./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version ff03de63
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-ff03de6
[2021-12-21 15:07:07,240 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-21 15:07:07,241 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-21 15:07:07,291 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-21 15:07:07,292 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-21 15:07:07,294 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-21 15:07:07,295 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-21 15:07:07,298 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-21 15:07:07,299 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-21 15:07:07,303 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-21 15:07:07,304 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-21 15:07:07,305 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-21 15:07:07,305 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-21 15:07:07,307 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-21 15:07:07,308 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-21 15:07:07,309 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-21 15:07:07,312 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-21 15:07:07,312 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-21 15:07:07,313 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-21 15:07:07,315 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-21 15:07:07,318 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-21 15:07:07,319 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-21 15:07:07,320 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-21 15:07:07,321 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-21 15:07:07,323 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-21 15:07:07,324 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-21 15:07:07,325 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-21 15:07:07,326 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-21 15:07:07,326 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-21 15:07:07,327 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-21 15:07:07,327 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-21 15:07:07,328 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-21 15:07:07,329 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-21 15:07:07,330 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-21 15:07:07,330 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-21 15:07:07,331 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-21 15:07:07,331 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-21 15:07:07,331 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-21 15:07:07,331 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-21 15:07:07,332 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-21 15:07:07,332 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-21 15:07:07,333 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-12-21 15:07:07,358 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-21 15:07:07,358 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-21 15:07:07,358 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-21 15:07:07,358 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-21 15:07:07,359 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-21 15:07:07,359 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-21 15:07:07,359 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-21 15:07:07,360 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-21 15:07:07,360 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-21 15:07:07,360 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-21 15:07:07,360 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-12-21 15:07:07,360 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-21 15:07:07,360 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-21 15:07:07,361 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-21 15:07:07,362 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-12-21 15:07:07,362 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-21 15:07:07,362 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-21 15:07:07,362 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-12-21 15:07:07,362 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-21 15:07:07,362 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-21 15:07:07,363 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-12-21 15:07:07,363 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-12-21 15:07:07,363 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-21 15:07:07,363 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-21 15:07:07,363 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-12-21 15:07:07,363 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-12-21 15:07:07,364 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-12-21 15:07:07,364 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-12-21 15:07:07,364 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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87
[2021-12-21 15:07:07,558 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-21 15:07:07,587 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-21 15:07:07,590 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-21 15:07:07,591 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-21 15:07:07,592 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-21 15:07:07,593 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-21 15:07:07,633 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d75fbcf0/ffc99c4711344e189bdabcc3148065f2/FLAG5ce69c13d
[2021-12-21 15:07:08,067 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-21 15:07:08,068 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-21 15:07:08,084 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d75fbcf0/ffc99c4711344e189bdabcc3148065f2/FLAG5ce69c13d
[2021-12-21 15:07:08,095 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d75fbcf0/ffc99c4711344e189bdabcc3148065f2
[2021-12-21 15:07:08,098 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-21 15:07:08,100 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-21 15:07:08,101 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-21 15:07:08,101 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-21 15:07:08,103 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-21 15:07:08,104 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,104 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16abbe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08, skipping insertion in model container
[2021-12-21 15:07:08,105 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,110 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-21 15:07:08,149 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-21 15:07:08,288 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2021-12-21 15:07:08,460 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-21 15:07:08,469 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-21 15:07:08,482 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2021-12-21 15:07:08,526 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-21 15:07:08,565 INFO  L208         MainTranslator]: Completed translation
[2021-12-21 15:07:08,566 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08 WrapperNode
[2021-12-21 15:07:08,566 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-21 15:07:08,567 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-21 15:07:08,567 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-21 15:07:08,568 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-21 15:07:08,572 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,595 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,622 INFO  L137                Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274
[2021-12-21 15:07:08,622 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-21 15:07:08,623 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-21 15:07:08,623 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-21 15:07:08,623 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-21 15:07:08,639 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,640 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,655 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,658 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,666 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,683 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,685 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,699 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-21 15:07:08,700 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-21 15:07:08,700 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-21 15:07:08,700 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-21 15:07:08,701 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (1/1) ...
[2021-12-21 15:07:08,709 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-21 15:07:08,719 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-21 15:07:08,730 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)
[2021-12-21 15:07:08,758 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-21 15:07:08,759 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-12-21 15:07:08,759 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-21 15:07:08,759 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-21 15:07:08,759 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-21 15:07:08,759 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-12-21 15:07:08,759 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-12-21 15:07:08,760 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-12-21 15:07:08,760 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-12-21 15:07:08,760 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-12-21 15:07:08,760 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-12-21 15:07:08,760 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-12-21 15:07:08,760 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-12-21 15:07:08,760 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-21 15:07:08,761 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-21 15:07:08,762 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-12-21 15:07:08,751 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
[2021-12-21 15:07:08,924 INFO  L234             CfgBuilder]: Building ICFG
[2021-12-21 15:07:08,928 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-21 15:07:09,470 INFO  L275             CfgBuilder]: Performing block encoding
[2021-12-21 15:07:09,817 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-21 15:07:09,817 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2021-12-21 15:07:09,819 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:07:09 BoogieIcfgContainer
[2021-12-21 15:07:09,819 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-21 15:07:09,820 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-21 15:07:09,820 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-12-21 15:07:09,822 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-12-21 15:07:09,822 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:07:08" (1/3) ...
[2021-12-21 15:07:09,823 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345eb0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:07:09, skipping insertion in model container
[2021-12-21 15:07:09,823 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:07:08" (2/3) ...
[2021-12-21 15:07:09,823 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345eb0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:07:09, skipping insertion in model container
[2021-12-21 15:07:09,823 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:07:09" (3/3) ...
[2021-12-21 15:07:09,824 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-21 15:07:09,829 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-12-21 15:07:09,830 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-21 15:07:09,830 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-12-21 15:07:09,830 INFO  L513   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-12-21 15:07:09,871 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,871 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,871 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,871 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,871 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,872 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,872 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,872 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,872 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,872 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,873 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,874 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,874 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,874 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,874 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,874 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,874 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,875 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,876 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,877 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,878 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,879 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,880 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,880 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,880 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,880 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,880 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,881 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,882 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,882 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,882 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,883 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,885 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,885 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,885 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,885 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,885 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,889 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,890 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,890 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,890 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,890 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,890 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,890 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,891 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,892 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,893 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,894 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,896 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,896 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,896 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,896 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,896 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,897 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,898 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,899 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,899 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,899 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,900 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,901 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,902 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,902 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,902 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,902 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,902 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,903 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,905 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,906 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,906 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,907 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,908 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,913 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,913 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,913 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,915 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,915 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,915 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,915 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,915 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,915 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,916 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,917 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,918 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,919 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,920 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,921 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-21 15:07:09,922 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-12-21 15:07:09,963 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-21 15:07:09,977 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=true, 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
[2021-12-21 15:07:09,977 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-12-21 15:07:09,988 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow
[2021-12-21 15:07:10,030 INFO  L129       PetriNetUnfolder]: 2/111 cut-off events.
[2021-12-21 15:07:10,030 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-21 15:07:10,033 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2021-12-21 15:07:10,033 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow
[2021-12-21 15:07:10,037 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow
[2021-12-21 15:07:10,053 INFO  L129       PetriNetUnfolder]: 0/74 cut-off events.
[2021-12-21 15:07:10,053 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-21 15:07:10,053 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:10,054 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]
[2021-12-21 15:07:10,054 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:10,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:10,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1547640948, now seen corresponding path program 1 times
[2021-12-21 15:07:10,067 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:10,067 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572579615]
[2021-12-21 15:07:10,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:10,068 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:10,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:10,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:10,343 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:10,343 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572579615]
[2021-12-21 15:07:10,344 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572579615] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:10,344 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:10,344 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-21 15:07:10,345 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770659526]
[2021-12-21 15:07:10,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:10,351 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-21 15:07:10,351 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:10,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-21 15:07:10,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-21 15:07:10,369 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114
[2021-12-21 15:07:10,391 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:10,391 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:10,391 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114
[2021-12-21 15:07:10,392 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:10,532 INFO  L129       PetriNetUnfolder]: 126/549 cut-off events.
[2021-12-21 15:07:10,532 INFO  L130       PetriNetUnfolder]: For 11/11 co-relation queries the response was YES.
[2021-12-21 15:07:10,534 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 785 conditions, 549 events. 126/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2889 event pairs, 34 based on Foata normal form. 24/540 useless extension candidates. Maximal degree in co-relation 734. Up to 141 conditions per place. 
[2021-12-21 15:07:10,537 INFO  L132   encePairwiseOnDemand]: 109/114 looper letters, 16 selfloop transitions, 2 changer transitions 0/113 dead transitions.
[2021-12-21 15:07:10,537 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 271 flow
[2021-12-21 15:07:10,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-12-21 15:07:10,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-12-21 15:07:10,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions.
[2021-12-21 15:07:10,551 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9269005847953217
[2021-12-21 15:07:10,552 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 317 transitions.
[2021-12-21 15:07:10,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions.
[2021-12-21 15:07:10,555 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:10,557 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions.
[2021-12-21 15:07:10,561 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:10,566 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:10,566 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:10,568 INFO  L186             Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 317 transitions.
[2021-12-21 15:07:10,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 271 flow
[2021-12-21 15:07:10,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-12-21 15:07:10,580 INFO  L242             Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow
[2021-12-21 15:07:10,582 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107}
[2021-12-21 15:07:10,586 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places.
[2021-12-21 15:07:10,586 INFO  L470      AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow
[2021-12-21 15:07:10,586 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:10,586 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:10,587 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]
[2021-12-21 15:07:10,587 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-12-21 15:07:10,587 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:10,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:10,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 84128766, now seen corresponding path program 1 times
[2021-12-21 15:07:10,588 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:10,588 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258088357]
[2021-12-21 15:07:10,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:10,588 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:10,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:10,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:10,807 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:10,808 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258088357]
[2021-12-21 15:07:10,808 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258088357] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:10,808 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:10,808 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-21 15:07:10,808 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122637096]
[2021-12-21 15:07:10,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:10,809 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-21 15:07:10,809 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:10,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-21 15:07:10,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-21 15:07:10,811 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114
[2021-12-21 15:07:10,812 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand  has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:10,812 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:10,812 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114
[2021-12-21 15:07:10,812 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:11,211 INFO  L129       PetriNetUnfolder]: 418/1209 cut-off events.
[2021-12-21 15:07:11,212 INFO  L130       PetriNetUnfolder]: For 80/80 co-relation queries the response was YES.
[2021-12-21 15:07:11,214 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 1209 events. 418/1209 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8118 event pairs, 70 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 1934. Up to 267 conditions per place. 
[2021-12-21 15:07:11,216 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 20 selfloop transitions, 2 changer transitions 48/148 dead transitions.
[2021-12-21 15:07:11,217 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 440 flow
[2021-12-21 15:07:11,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-21 15:07:11,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-21 15:07:11,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions.
[2021-12-21 15:07:11,219 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8664717348927875
[2021-12-21 15:07:11,219 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 889 transitions.
[2021-12-21 15:07:11,219 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions.
[2021-12-21 15:07:11,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:11,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions.
[2021-12-21 15:07:11,222 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)
[2021-12-21 15:07:11,224 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:11,224 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:11,225 INFO  L186             Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 889 transitions.
[2021-12-21 15:07:11,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 440 flow
[2021-12-21 15:07:11,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 148 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-12-21 15:07:11,227 INFO  L242             Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow
[2021-12-21 15:07:11,228 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95}
[2021-12-21 15:07:11,228 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places.
[2021-12-21 15:07:11,229 INFO  L470      AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow
[2021-12-21 15:07:11,229 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:11,229 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:11,229 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]
[2021-12-21 15:07:11,229 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-12-21 15:07:11,230 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:11,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:11,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -854671236, now seen corresponding path program 1 times
[2021-12-21 15:07:11,230 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:11,230 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730470131]
[2021-12-21 15:07:11,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:11,231 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:11,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:11,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:11,422 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:11,422 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730470131]
[2021-12-21 15:07:11,423 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730470131] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:11,423 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:11,423 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-21 15:07:11,424 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133052002]
[2021-12-21 15:07:11,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:11,424 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-21 15:07:11,425 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:11,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-21 15:07:11,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-21 15:07:11,427 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114
[2021-12-21 15:07:11,428 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:11,428 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:11,428 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114
[2021-12-21 15:07:11,428 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:11,766 INFO  L129       PetriNetUnfolder]: 524/1135 cut-off events.
[2021-12-21 15:07:11,766 INFO  L130       PetriNetUnfolder]: For 272/272 co-relation queries the response was YES.
[2021-12-21 15:07:11,769 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1135 events. 524/1135 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6111 event pairs, 282 based on Foata normal form. 24/1100 useless extension candidates. Maximal degree in co-relation 2247. Up to 536 conditions per place. 
[2021-12-21 15:07:11,773 INFO  L132   encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 37/141 dead transitions.
[2021-12-21 15:07:11,773 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 141 transitions, 463 flow
[2021-12-21 15:07:11,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-21 15:07:11,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-21 15:07:11,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions.
[2021-12-21 15:07:11,775 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.854775828460039
[2021-12-21 15:07:11,775 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 877 transitions.
[2021-12-21 15:07:11,775 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions.
[2021-12-21 15:07:11,776 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:11,776 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions.
[2021-12-21 15:07:11,777 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:11,779 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:11,779 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:11,779 INFO  L186             Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 877 transitions.
[2021-12-21 15:07:11,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 141 transitions, 463 flow
[2021-12-21 15:07:11,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 141 transitions, 429 flow, removed 14 selfloop flow, removed 8 redundant places.
[2021-12-21 15:07:11,787 INFO  L242             Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow
[2021-12-21 15:07:11,787 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97}
[2021-12-21 15:07:11,787 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places.
[2021-12-21 15:07:11,787 INFO  L470      AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow
[2021-12-21 15:07:11,788 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:11,788 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:11,788 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]
[2021-12-21 15:07:11,788 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-12-21 15:07:11,788 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:11,788 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:11,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 1519173115, now seen corresponding path program 1 times
[2021-12-21 15:07:11,789 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:11,789 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18930438]
[2021-12-21 15:07:11,789 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:11,789 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:11,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:12,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:12,159 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:12,159 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18930438]
[2021-12-21 15:07:12,159 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18930438] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:12,160 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:12,160 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-21 15:07:12,160 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653401984]
[2021-12-21 15:07:12,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:12,161 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-21 15:07:12,161 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:12,162 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-21 15:07:12,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2021-12-21 15:07:12,165 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114
[2021-12-21 15:07:12,167 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand  has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:12,167 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:12,167 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114
[2021-12-21 15:07:12,167 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:12,713 INFO  L129       PetriNetUnfolder]: 417/993 cut-off events.
[2021-12-21 15:07:12,713 INFO  L130       PetriNetUnfolder]: For 795/795 co-relation queries the response was YES.
[2021-12-21 15:07:12,717 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 993 events. 417/993 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5381 event pairs, 49 based on Foata normal form. 27/961 useless extension candidates. Maximal degree in co-relation 2237. Up to 308 conditions per place. 
[2021-12-21 15:07:12,719 INFO  L132   encePairwiseOnDemand]: 100/114 looper letters, 29 selfloop transitions, 12 changer transitions 38/153 dead transitions.
[2021-12-21 15:07:12,719 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 550 flow
[2021-12-21 15:07:12,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-21 15:07:12,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-21 15:07:12,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1630 transitions.
[2021-12-21 15:07:12,723 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7943469785575049
[2021-12-21 15:07:12,723 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1630 transitions.
[2021-12-21 15:07:12,723 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1630 transitions.
[2021-12-21 15:07:12,724 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:12,724 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1630 transitions.
[2021-12-21 15:07:12,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 90.55555555555556) internal successors, (1630), 18 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:12,729 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:12,731 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:12,731 INFO  L186             Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 18 states and 1630 transitions.
[2021-12-21 15:07:12,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 550 flow
[2021-12-21 15:07:12,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 529 flow, removed 9 selfloop flow, removed 4 redundant places.
[2021-12-21 15:07:12,737 INFO  L242             Difference]: Finished difference. Result has 138 places, 104 transitions, 335 flow
[2021-12-21 15:07:12,738 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=335, PETRI_PLACES=138, PETRI_TRANSITIONS=104}
[2021-12-21 15:07:12,739 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places.
[2021-12-21 15:07:12,739 INFO  L470      AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 335 flow
[2021-12-21 15:07:12,739 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:12,739 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:12,740 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]
[2021-12-21 15:07:12,740 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-12-21 15:07:12,740 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:12,740 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:12,740 INFO  L85        PathProgramCache]: Analyzing trace with hash -1270785456, now seen corresponding path program 1 times
[2021-12-21 15:07:12,740 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:12,741 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391378135]
[2021-12-21 15:07:12,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:12,741 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:12,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:12,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:12,886 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:12,886 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391378135]
[2021-12-21 15:07:12,887 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391378135] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:12,887 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:12,887 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-21 15:07:12,887 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929676032]
[2021-12-21 15:07:12,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:12,887 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-21 15:07:12,887 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:12,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-21 15:07:12,888 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-21 15:07:12,889 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114
[2021-12-21 15:07:12,889 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 104 transitions, 335 flow. Second operand  has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:12,889 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:12,889 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114
[2021-12-21 15:07:12,889 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:13,251 INFO  L129       PetriNetUnfolder]: 569/1297 cut-off events.
[2021-12-21 15:07:13,251 INFO  L130       PetriNetUnfolder]: For 4490/4498 co-relation queries the response was YES.
[2021-12-21 15:07:13,256 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 1297 events. 569/1297 cut-off events. For 4490/4498 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7685 event pairs, 182 based on Foata normal form. 20/1238 useless extension candidates. Maximal degree in co-relation 4944. Up to 467 conditions per place. 
[2021-12-21 15:07:13,260 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 36 selfloop transitions, 3 changer transitions 29/145 dead transitions.
[2021-12-21 15:07:13,260 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 821 flow
[2021-12-21 15:07:13,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-21 15:07:13,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-21 15:07:13,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions.
[2021-12-21 15:07:13,263 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.847953216374269
[2021-12-21 15:07:13,263 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 870 transitions.
[2021-12-21 15:07:13,263 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions.
[2021-12-21 15:07:13,263 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:13,263 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions.
[2021-12-21 15:07:13,264 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:13,266 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:13,266 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:13,266 INFO  L186             Difference]: Start difference. First operand has 138 places, 104 transitions, 335 flow. Second operand 9 states and 870 transitions.
[2021-12-21 15:07:13,267 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 821 flow
[2021-12-21 15:07:13,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 758 flow, removed 24 selfloop flow, removed 10 redundant places.
[2021-12-21 15:07:13,275 INFO  L242             Difference]: Finished difference. Result has 134 places, 104 transitions, 332 flow
[2021-12-21 15:07:13,276 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=134, PETRI_TRANSITIONS=104}
[2021-12-21 15:07:13,278 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places.
[2021-12-21 15:07:13,278 INFO  L470      AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 332 flow
[2021-12-21 15:07:13,278 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:13,278 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:13,278 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]
[2021-12-21 15:07:13,278 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-12-21 15:07:13,279 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:13,279 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:13,279 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859241053, now seen corresponding path program 1 times
[2021-12-21 15:07:13,279 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:13,279 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553731939]
[2021-12-21 15:07:13,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:13,279 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:13,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:13,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:13,539 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:13,539 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553731939]
[2021-12-21 15:07:13,539 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553731939] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:13,539 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:13,539 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-21 15:07:13,540 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540111414]
[2021-12-21 15:07:13,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:13,540 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-21 15:07:13,541 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:13,541 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-21 15:07:13,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2021-12-21 15:07:13,543 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114
[2021-12-21 15:07:13,543 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 332 flow. Second operand  has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:13,544 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:13,544 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114
[2021-12-21 15:07:13,544 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:14,115 INFO  L129       PetriNetUnfolder]: 545/1364 cut-off events.
[2021-12-21 15:07:14,115 INFO  L130       PetriNetUnfolder]: For 5430/5526 co-relation queries the response was YES.
[2021-12-21 15:07:14,121 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 1364 events. 545/1364 cut-off events. For 5430/5526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8532 event pairs, 78 based on Foata normal form. 27/1262 useless extension candidates. Maximal degree in co-relation 5152. Up to 535 conditions per place. 
[2021-12-21 15:07:14,126 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 38 selfloop transitions, 20 changer transitions 25/157 dead transitions.
[2021-12-21 15:07:14,126 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 157 transitions, 905 flow
[2021-12-21 15:07:14,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-12-21 15:07:14,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-12-21 15:07:14,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1366 transitions.
[2021-12-21 15:07:14,129 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7988304093567251
[2021-12-21 15:07:14,129 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1366 transitions.
[2021-12-21 15:07:14,129 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1366 transitions.
[2021-12-21 15:07:14,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:14,156 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1366 transitions.
[2021-12-21 15:07:14,159 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 91.06666666666666) internal successors, (1366), 15 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:14,161 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:14,161 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:14,161 INFO  L186             Difference]: Start difference. First operand has 134 places, 104 transitions, 332 flow. Second operand 15 states and 1366 transitions.
[2021-12-21 15:07:14,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 157 transitions, 905 flow
[2021-12-21 15:07:14,168 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 157 transitions, 868 flow, removed 17 selfloop flow, removed 7 redundant places.
[2021-12-21 15:07:14,170 INFO  L242             Difference]: Finished difference. Result has 144 places, 115 transitions, 476 flow
[2021-12-21 15:07:14,170 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=476, PETRI_PLACES=144, PETRI_TRANSITIONS=115}
[2021-12-21 15:07:14,172 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places.
[2021-12-21 15:07:14,172 INFO  L470      AbstractCegarLoop]: Abstraction has has 144 places, 115 transitions, 476 flow
[2021-12-21 15:07:14,173 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:14,173 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:14,173 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]
[2021-12-21 15:07:14,173 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-12-21 15:07:14,173 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:14,174 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:14,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 153497483, now seen corresponding path program 2 times
[2021-12-21 15:07:14,174 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:14,174 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589335455]
[2021-12-21 15:07:14,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:14,174 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:14,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:14,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:14,468 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:14,468 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589335455]
[2021-12-21 15:07:14,468 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589335455] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:14,468 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:14,468 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-12-21 15:07:14,469 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244023463]
[2021-12-21 15:07:14,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:14,473 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-21 15:07:14,473 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:14,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-21 15:07:14,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2021-12-21 15:07:14,474 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-21 15:07:14,475 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 115 transitions, 476 flow. Second operand  has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:14,475 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:14,475 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-21 15:07:14,475 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:15,039 INFO  L129       PetriNetUnfolder]: 563/1378 cut-off events.
[2021-12-21 15:07:15,040 INFO  L130       PetriNetUnfolder]: For 10183/10815 co-relation queries the response was YES.
[2021-12-21 15:07:15,046 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 1378 events. 563/1378 cut-off events. For 10183/10815 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8493 event pairs, 80 based on Foata normal form. 52/1293 useless extension candidates. Maximal degree in co-relation 6586. Up to 548 conditions per place. 
[2021-12-21 15:07:15,053 INFO  L132   encePairwiseOnDemand]: 100/114 looper letters, 32 selfloop transitions, 24 changer transitions 26/155 dead transitions.
[2021-12-21 15:07:15,053 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 155 transitions, 1086 flow
[2021-12-21 15:07:15,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-21 15:07:15,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-21 15:07:15,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1434 transitions.
[2021-12-21 15:07:15,057 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7861842105263158
[2021-12-21 15:07:15,057 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1434 transitions.
[2021-12-21 15:07:15,057 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1434 transitions.
[2021-12-21 15:07:15,057 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:15,057 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1434 transitions.
[2021-12-21 15:07:15,059 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 89.625) internal successors, (1434), 16 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,062 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,062 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,063 INFO  L186             Difference]: Start difference. First operand has 144 places, 115 transitions, 476 flow. Second operand 16 states and 1434 transitions.
[2021-12-21 15:07:15,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 155 transitions, 1086 flow
[2021-12-21 15:07:15,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 155 transitions, 986 flow, removed 46 selfloop flow, removed 10 redundant places.
[2021-12-21 15:07:15,075 INFO  L242             Difference]: Finished difference. Result has 150 places, 117 transitions, 562 flow
[2021-12-21 15:07:15,075 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=562, PETRI_PLACES=150, PETRI_TRANSITIONS=117}
[2021-12-21 15:07:15,076 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places.
[2021-12-21 15:07:15,076 INFO  L470      AbstractCegarLoop]: Abstraction has has 150 places, 117 transitions, 562 flow
[2021-12-21 15:07:15,077 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,077 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:15,077 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]
[2021-12-21 15:07:15,077 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-12-21 15:07:15,077 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:15,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:15,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 1585920861, now seen corresponding path program 3 times
[2021-12-21 15:07:15,078 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:15,078 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075074844]
[2021-12-21 15:07:15,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:15,079 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:15,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:15,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:15,275 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:15,275 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075074844]
[2021-12-21 15:07:15,275 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075074844] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:15,275 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:15,275 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-21 15:07:15,275 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786087900]
[2021-12-21 15:07:15,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:15,276 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-21 15:07:15,276 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:15,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-21 15:07:15,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-12-21 15:07:15,277 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114
[2021-12-21 15:07:15,278 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 117 transitions, 562 flow. Second operand  has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,278 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:15,278 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114
[2021-12-21 15:07:15,278 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:15,777 INFO  L129       PetriNetUnfolder]: 529/1398 cut-off events.
[2021-12-21 15:07:15,777 INFO  L130       PetriNetUnfolder]: For 13087/14313 co-relation queries the response was YES.
[2021-12-21 15:07:15,783 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 1398 events. 529/1398 cut-off events. For 13087/14313 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9446 event pairs, 125 based on Foata normal form. 46/1321 useless extension candidates. Maximal degree in co-relation 7206. Up to 532 conditions per place. 
[2021-12-21 15:07:15,789 INFO  L132   encePairwiseOnDemand]: 103/114 looper letters, 39 selfloop transitions, 13 changer transitions 27/151 dead transitions.
[2021-12-21 15:07:15,789 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 151 transitions, 1193 flow
[2021-12-21 15:07:15,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-21 15:07:15,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-21 15:07:15,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1156 transitions.
[2021-12-21 15:07:15,791 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7800269905533064
[2021-12-21 15:07:15,791 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1156 transitions.
[2021-12-21 15:07:15,791 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1156 transitions.
[2021-12-21 15:07:15,792 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:15,792 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1156 transitions.
[2021-12-21 15:07:15,793 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)
[2021-12-21 15:07:15,795 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,795 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,796 INFO  L186             Difference]: Start difference. First operand has 150 places, 117 transitions, 562 flow. Second operand 13 states and 1156 transitions.
[2021-12-21 15:07:15,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 151 transitions, 1193 flow
[2021-12-21 15:07:15,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 151 transitions, 1021 flow, removed 76 selfloop flow, removed 13 redundant places.
[2021-12-21 15:07:15,807 INFO  L242             Difference]: Finished difference. Result has 150 places, 118 transitions, 589 flow
[2021-12-21 15:07:15,807 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=589, PETRI_PLACES=150, PETRI_TRANSITIONS=118}
[2021-12-21 15:07:15,807 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places.
[2021-12-21 15:07:15,808 INFO  L470      AbstractCegarLoop]: Abstraction has has 150 places, 118 transitions, 589 flow
[2021-12-21 15:07:15,808 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 85.83333333333333) internal successors, (1030), 12 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:15,808 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:15,808 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]
[2021-12-21 15:07:15,808 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-12-21 15:07:15,808 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:15,808 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:15,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -78862206, now seen corresponding path program 1 times
[2021-12-21 15:07:15,809 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:15,809 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72522713]
[2021-12-21 15:07:15,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:15,809 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:15,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:16,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:16,038 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:16,038 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72522713]
[2021-12-21 15:07:16,038 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72522713] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:16,038 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:16,038 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-12-21 15:07:16,039 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879755368]
[2021-12-21 15:07:16,039 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:16,039 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-12-21 15:07:16,039 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:16,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-12-21 15:07:16,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240
[2021-12-21 15:07:16,040 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-21 15:07:16,041 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 118 transitions, 589 flow. Second operand  has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:16,041 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:16,041 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-21 15:07:16,041 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:16,734 INFO  L129       PetriNetUnfolder]: 536/1585 cut-off events.
[2021-12-21 15:07:16,734 INFO  L130       PetriNetUnfolder]: For 13063/14663 co-relation queries the response was YES.
[2021-12-21 15:07:16,742 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 1585 events. 536/1585 cut-off events. For 13063/14663 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11961 event pairs, 57 based on Foata normal form. 111/1586 useless extension candidates. Maximal degree in co-relation 7669. Up to 536 conditions per place. 
[2021-12-21 15:07:16,749 INFO  L132   encePairwiseOnDemand]: 97/114 looper letters, 35 selfloop transitions, 23 changer transitions 52/181 dead transitions.
[2021-12-21 15:07:16,750 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 181 transitions, 1517 flow
[2021-12-21 15:07:16,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-12-21 15:07:16,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2021-12-21 15:07:16,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1661 transitions.
[2021-12-21 15:07:16,754 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7668513388734995
[2021-12-21 15:07:16,754 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1661 transitions.
[2021-12-21 15:07:16,754 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1661 transitions.
[2021-12-21 15:07:16,755 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:16,755 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1661 transitions.
[2021-12-21 15:07:16,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 87.42105263157895) internal successors, (1661), 19 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:16,761 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:16,762 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:16,762 INFO  L186             Difference]: Start difference. First operand has 150 places, 118 transitions, 589 flow. Second operand 19 states and 1661 transitions.
[2021-12-21 15:07:16,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 181 transitions, 1517 flow
[2021-12-21 15:07:16,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 181 transitions, 1398 flow, removed 52 selfloop flow, removed 10 redundant places.
[2021-12-21 15:07:16,779 INFO  L242             Difference]: Finished difference. Result has 163 places, 124 transitions, 740 flow
[2021-12-21 15:07:16,779 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=740, PETRI_PLACES=163, PETRI_TRANSITIONS=124}
[2021-12-21 15:07:16,780 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places.
[2021-12-21 15:07:16,780 INFO  L470      AbstractCegarLoop]: Abstraction has has 163 places, 124 transitions, 740 flow
[2021-12-21 15:07:16,780 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:16,780 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:16,780 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]
[2021-12-21 15:07:16,780 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-12-21 15:07:16,780 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:16,781 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:16,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 529644052, now seen corresponding path program 2 times
[2021-12-21 15:07:16,781 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:16,781 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893645859]
[2021-12-21 15:07:16,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:16,781 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:16,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:16,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:16,941 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:16,942 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893645859]
[2021-12-21 15:07:16,942 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893645859] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:16,942 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:16,942 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-21 15:07:16,942 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981233688]
[2021-12-21 15:07:16,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:16,942 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-21 15:07:16,942 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:16,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-21 15:07:16,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-12-21 15:07:16,943 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-21 15:07:16,944 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 124 transitions, 740 flow. Second operand  has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:16,944 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:16,944 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-21 15:07:16,944 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:17,382 INFO  L129       PetriNetUnfolder]: 481/1417 cut-off events.
[2021-12-21 15:07:17,382 INFO  L130       PetriNetUnfolder]: For 15430/17838 co-relation queries the response was YES.
[2021-12-21 15:07:17,390 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 1417 events. 481/1417 cut-off events. For 15430/17838 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10262 event pairs, 102 based on Foata normal form. 85/1388 useless extension candidates. Maximal degree in co-relation 8250. Up to 625 conditions per place. 
[2021-12-21 15:07:17,396 INFO  L132   encePairwiseOnDemand]: 103/114 looper letters, 53 selfloop transitions, 29 changer transitions 20/173 dead transitions.
[2021-12-21 15:07:17,396 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 173 transitions, 1713 flow
[2021-12-21 15:07:17,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-21 15:07:17,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-21 15:07:17,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2021-12-21 15:07:17,423 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.773524720893142
[2021-12-21 15:07:17,423 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2021-12-21 15:07:17,423 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2021-12-21 15:07:17,423 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:17,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2021-12-21 15:07:17,425 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:17,426 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:17,426 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:17,426 INFO  L186             Difference]: Start difference. First operand has 163 places, 124 transitions, 740 flow. Second operand 11 states and 970 transitions.
[2021-12-21 15:07:17,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 173 transitions, 1713 flow
[2021-12-21 15:07:17,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 173 transitions, 1499 flow, removed 87 selfloop flow, removed 14 redundant places.
[2021-12-21 15:07:17,444 INFO  L242             Difference]: Finished difference. Result has 155 places, 143 transitions, 1035 flow
[2021-12-21 15:07:17,444 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1035, PETRI_PLACES=155, PETRI_TRANSITIONS=143}
[2021-12-21 15:07:17,444 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places.
[2021-12-21 15:07:17,444 INFO  L470      AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 1035 flow
[2021-12-21 15:07:17,445 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:17,445 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:17,445 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]
[2021-12-21 15:07:17,445 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-12-21 15:07:17,445 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:17,445 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:17,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1019708772, now seen corresponding path program 3 times
[2021-12-21 15:07:17,445 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:17,446 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682640839]
[2021-12-21 15:07:17,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:17,446 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:17,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:17,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:17,692 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:17,693 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682640839]
[2021-12-21 15:07:17,693 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682640839] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:17,693 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:17,693 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-12-21 15:07:17,693 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848633153]
[2021-12-21 15:07:17,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:17,693 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-12-21 15:07:17,693 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:17,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-12-21 15:07:17,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240
[2021-12-21 15:07:17,695 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114
[2021-12-21 15:07:17,696 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 1035 flow. Second operand  has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:17,696 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:17,696 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114
[2021-12-21 15:07:17,696 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:18,319 INFO  L129       PetriNetUnfolder]: 471/1418 cut-off events.
[2021-12-21 15:07:18,320 INFO  L130       PetriNetUnfolder]: For 12982/16946 co-relation queries the response was YES.
[2021-12-21 15:07:18,326 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1418 events. 471/1418 cut-off events. For 12982/16946 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10249 event pairs, 87 based on Foata normal form. 98/1394 useless extension candidates. Maximal degree in co-relation 7910. Up to 562 conditions per place. 
[2021-12-21 15:07:18,330 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 50 selfloop transitions, 29 changer transitions 33/182 dead transitions.
[2021-12-21 15:07:18,330 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 1745 flow
[2021-12-21 15:07:18,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-21 15:07:18,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-21 15:07:18,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1548 transitions.
[2021-12-21 15:07:18,332 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7543859649122807
[2021-12-21 15:07:18,332 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1548 transitions.
[2021-12-21 15:07:18,332 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1548 transitions.
[2021-12-21 15:07:18,333 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:18,333 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1548 transitions.
[2021-12-21 15:07:18,335 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:18,337 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:18,337 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:18,337 INFO  L186             Difference]: Start difference. First operand has 155 places, 143 transitions, 1035 flow. Second operand 18 states and 1548 transitions.
[2021-12-21 15:07:18,337 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 182 transitions, 1745 flow
[2021-12-21 15:07:18,346 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 182 transitions, 1692 flow, removed 25 selfloop flow, removed 5 redundant places.
[2021-12-21 15:07:18,348 INFO  L242             Difference]: Finished difference. Result has 170 places, 140 transitions, 1032 flow
[2021-12-21 15:07:18,349 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1032, PETRI_PLACES=170, PETRI_TRANSITIONS=140}
[2021-12-21 15:07:18,349 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places.
[2021-12-21 15:07:18,349 INFO  L470      AbstractCegarLoop]: Abstraction has has 170 places, 140 transitions, 1032 flow
[2021-12-21 15:07:18,350 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:18,350 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:18,350 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]
[2021-12-21 15:07:18,350 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-12-21 15:07:18,350 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:18,350 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:18,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 1125697522, now seen corresponding path program 4 times
[2021-12-21 15:07:18,350 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:18,350 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144183557]
[2021-12-21 15:07:18,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:18,350 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:18,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:18,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:18,525 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:18,525 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144183557]
[2021-12-21 15:07:18,525 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144183557] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:18,525 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:18,525 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-21 15:07:18,525 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555701931]
[2021-12-21 15:07:18,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:18,525 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-21 15:07:18,525 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:18,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-21 15:07:18,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-12-21 15:07:18,526 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114
[2021-12-21 15:07:18,527 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 140 transitions, 1032 flow. Second operand  has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:18,527 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:18,527 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114
[2021-12-21 15:07:18,527 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:18,997 INFO  L129       PetriNetUnfolder]: 450/1402 cut-off events.
[2021-12-21 15:07:18,999 INFO  L130       PetriNetUnfolder]: For 15629/21494 co-relation queries the response was YES.
[2021-12-21 15:07:19,004 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8149 conditions, 1402 events. 450/1402 cut-off events. For 15629/21494 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10291 event pairs, 67 based on Foata normal form. 62/1358 useless extension candidates. Maximal degree in co-relation 8052. Up to 554 conditions per place. 
[2021-12-21 15:07:19,010 INFO  L132   encePairwiseOnDemand]: 104/114 looper letters, 56 selfloop transitions, 22 changer transitions 21/173 dead transitions.
[2021-12-21 15:07:19,011 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 173 transitions, 1728 flow
[2021-12-21 15:07:19,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-12-21 15:07:19,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2021-12-21 15:07:19,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1086 transitions.
[2021-12-21 15:07:19,013 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.793859649122807
[2021-12-21 15:07:19,013 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1086 transitions.
[2021-12-21 15:07:19,014 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1086 transitions.
[2021-12-21 15:07:19,014 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:19,014 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1086 transitions.
[2021-12-21 15:07:19,016 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,017 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,018 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,018 INFO  L186             Difference]: Start difference. First operand has 170 places, 140 transitions, 1032 flow. Second operand 12 states and 1086 transitions.
[2021-12-21 15:07:19,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 173 transitions, 1728 flow
[2021-12-21 15:07:19,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 173 transitions, 1586 flow, removed 41 selfloop flow, removed 17 redundant places.
[2021-12-21 15:07:19,035 INFO  L242             Difference]: Finished difference. Result has 163 places, 146 transitions, 1156 flow
[2021-12-21 15:07:19,036 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1156, PETRI_PLACES=163, PETRI_TRANSITIONS=146}
[2021-12-21 15:07:19,037 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places.
[2021-12-21 15:07:19,037 INFO  L470      AbstractCegarLoop]: Abstraction has has 163 places, 146 transitions, 1156 flow
[2021-12-21 15:07:19,037 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,037 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:19,037 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]
[2021-12-21 15:07:19,038 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-12-21 15:07:19,039 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:19,039 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:19,039 INFO  L85        PathProgramCache]: Analyzing trace with hash -2046886782, now seen corresponding path program 5 times
[2021-12-21 15:07:19,039 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:19,040 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803962164]
[2021-12-21 15:07:19,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:19,040 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:19,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:19,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:19,324 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:19,324 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803962164]
[2021-12-21 15:07:19,324 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803962164] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:19,324 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:19,325 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-12-21 15:07:19,325 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342836854]
[2021-12-21 15:07:19,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:19,325 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-12-21 15:07:19,325 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:19,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-12-21 15:07:19,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240
[2021-12-21 15:07:19,326 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114
[2021-12-21 15:07:19,327 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 146 transitions, 1156 flow. Second operand  has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,327 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:19,327 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114
[2021-12-21 15:07:19,327 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:19,946 INFO  L129       PetriNetUnfolder]: 404/1355 cut-off events.
[2021-12-21 15:07:19,946 INFO  L130       PetriNetUnfolder]: For 14404/21448 co-relation queries the response was YES.
[2021-12-21 15:07:19,951 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1355 events. 404/1355 cut-off events. For 14404/21448 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10735 event pairs, 73 based on Foata normal form. 76/1328 useless extension candidates. Maximal degree in co-relation 7754. Up to 421 conditions per place. 
[2021-12-21 15:07:19,955 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 55 selfloop transitions, 19 changer transitions 42/184 dead transitions.
[2021-12-21 15:07:19,956 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 184 transitions, 1899 flow
[2021-12-21 15:07:19,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-12-21 15:07:19,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-12-21 15:07:19,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1429 transitions.
[2021-12-21 15:07:19,960 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.737358101135191
[2021-12-21 15:07:19,960 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1429 transitions.
[2021-12-21 15:07:19,960 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1429 transitions.
[2021-12-21 15:07:19,961 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:19,961 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1429 transitions.
[2021-12-21 15:07:19,962 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 84.05882352941177) internal successors, (1429), 17 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,964 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,964 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,964 INFO  L186             Difference]: Start difference. First operand has 163 places, 146 transitions, 1156 flow. Second operand 17 states and 1429 transitions.
[2021-12-21 15:07:19,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 184 transitions, 1899 flow
[2021-12-21 15:07:19,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 184 transitions, 1800 flow, removed 43 selfloop flow, removed 10 redundant places.
[2021-12-21 15:07:19,981 INFO  L242             Difference]: Finished difference. Result has 171 places, 135 transitions, 962 flow
[2021-12-21 15:07:19,981 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=962, PETRI_PLACES=171, PETRI_TRANSITIONS=135}
[2021-12-21 15:07:19,982 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places.
[2021-12-21 15:07:19,982 INFO  L470      AbstractCegarLoop]: Abstraction has has 171 places, 135 transitions, 962 flow
[2021-12-21 15:07:19,982 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 81.6875) internal successors, (1307), 16 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:19,982 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:19,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]
[2021-12-21 15:07:19,982 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-12-21 15:07:19,982 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:19,982 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:19,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -1955626832, now seen corresponding path program 1 times
[2021-12-21 15:07:19,983 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:19,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195058853]
[2021-12-21 15:07:19,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:19,983 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:20,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:20,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:20,053 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:20,053 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195058853]
[2021-12-21 15:07:20,054 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195058853] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:20,054 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:20,054 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-21 15:07:20,054 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739424176]
[2021-12-21 15:07:20,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:20,054 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-21 15:07:20,054 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:20,055 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-21 15:07:20,055 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-21 15:07:20,055 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-21 15:07:20,056 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 135 transitions, 962 flow. Second operand  has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:20,056 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:20,056 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-21 15:07:20,056 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:21,078 INFO  L129       PetriNetUnfolder]: 3251/6195 cut-off events.
[2021-12-21 15:07:21,078 INFO  L130       PetriNetUnfolder]: For 57011/57286 co-relation queries the response was YES.
[2021-12-21 15:07:21,101 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 29199 conditions, 6195 events. 3251/6195 cut-off events. For 57011/57286 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 47458 event pairs, 102 based on Foata normal form. 150/6126 useless extension candidates. Maximal degree in co-relation 29107. Up to 1875 conditions per place. 
[2021-12-21 15:07:21,112 INFO  L132   encePairwiseOnDemand]: 104/114 looper letters, 74 selfloop transitions, 6 changer transitions 158/314 dead transitions.
[2021-12-21 15:07:21,113 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 314 transitions, 3697 flow
[2021-12-21 15:07:21,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-21 15:07:21,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-21 15:07:21,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions.
[2021-12-21 15:07:21,115 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8578947368421053
[2021-12-21 15:07:21,115 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 978 transitions.
[2021-12-21 15:07:21,115 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 978 transitions.
[2021-12-21 15:07:21,115 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:21,115 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 978 transitions.
[2021-12-21 15:07:21,116 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.8) internal successors, (978), 10 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,117 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,118 INFO  L186             Difference]: Start difference. First operand has 171 places, 135 transitions, 962 flow. Second operand 10 states and 978 transitions.
[2021-12-21 15:07:21,118 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 314 transitions, 3697 flow
[2021-12-21 15:07:21,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 314 transitions, 3462 flow, removed 39 selfloop flow, removed 20 redundant places.
[2021-12-21 15:07:21,140 INFO  L242             Difference]: Finished difference. Result has 158 places, 128 transitions, 787 flow
[2021-12-21 15:07:21,141 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=787, PETRI_PLACES=158, PETRI_TRANSITIONS=128}
[2021-12-21 15:07:21,141 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places.
[2021-12-21 15:07:21,141 INFO  L470      AbstractCegarLoop]: Abstraction has has 158 places, 128 transitions, 787 flow
[2021-12-21 15:07:21,142 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,142 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:21,142 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]
[2021-12-21 15:07:21,142 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-12-21 15:07:21,142 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:21,142 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:21,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -1706371020, now seen corresponding path program 1 times
[2021-12-21 15:07:21,143 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:21,143 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687564600]
[2021-12-21 15:07:21,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:21,143 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:21,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:21,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:21,265 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:21,265 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687564600]
[2021-12-21 15:07:21,265 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687564600] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:21,265 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:21,265 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-21 15:07:21,265 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460393837]
[2021-12-21 15:07:21,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:21,266 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-21 15:07:21,266 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:21,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-21 15:07:21,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-21 15:07:21,267 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-21 15:07:21,267 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 128 transitions, 787 flow. Second operand  has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,267 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:21,267 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-21 15:07:21,267 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:21,733 INFO  L129       PetriNetUnfolder]: 1090/2610 cut-off events.
[2021-12-21 15:07:21,734 INFO  L130       PetriNetUnfolder]: For 20824/20913 co-relation queries the response was YES.
[2021-12-21 15:07:21,746 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 12863 conditions, 2610 events. 1090/2610 cut-off events. For 20824/20913 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19592 event pairs, 21 based on Foata normal form. 132/2713 useless extension candidates. Maximal degree in co-relation 12780. Up to 663 conditions per place. 
[2021-12-21 15:07:21,750 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 59 selfloop transitions, 9 changer transitions 112/256 dead transitions.
[2021-12-21 15:07:21,750 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 256 transitions, 2845 flow
[2021-12-21 15:07:21,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-21 15:07:21,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-21 15:07:21,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions.
[2021-12-21 15:07:21,752 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.856140350877193
[2021-12-21 15:07:21,752 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 976 transitions.
[2021-12-21 15:07:21,752 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions.
[2021-12-21 15:07:21,753 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:21,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions.
[2021-12-21 15:07:21,754 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,755 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,756 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,756 INFO  L186             Difference]: Start difference. First operand has 158 places, 128 transitions, 787 flow. Second operand 10 states and 976 transitions.
[2021-12-21 15:07:21,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 256 transitions, 2845 flow
[2021-12-21 15:07:21,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 256 transitions, 2760 flow, removed 15 selfloop flow, removed 6 redundant places.
[2021-12-21 15:07:21,776 INFO  L242             Difference]: Finished difference. Result has 161 places, 120 transitions, 692 flow
[2021-12-21 15:07:21,776 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=161, PETRI_TRANSITIONS=120}
[2021-12-21 15:07:21,777 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places.
[2021-12-21 15:07:21,777 INFO  L470      AbstractCegarLoop]: Abstraction has has 161 places, 120 transitions, 692 flow
[2021-12-21 15:07:21,777 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,777 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:21,777 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]
[2021-12-21 15:07:21,778 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-12-21 15:07:21,778 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:21,778 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:21,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 1896302775, now seen corresponding path program 1 times
[2021-12-21 15:07:21,778 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:21,778 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977133362]
[2021-12-21 15:07:21,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:21,779 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:21,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:21,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:21,952 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:21,952 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977133362]
[2021-12-21 15:07:21,953 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977133362] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:21,953 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:21,953 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-21 15:07:21,953 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191391476]
[2021-12-21 15:07:21,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:21,954 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-21 15:07:21,954 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:21,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-21 15:07:21,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-12-21 15:07:21,955 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-21 15:07:21,955 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 120 transitions, 692 flow. Second operand  has 10 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:21,956 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:21,956 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-21 15:07:21,956 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:22,342 INFO  L129       PetriNetUnfolder]: 221/1170 cut-off events.
[2021-12-21 15:07:22,343 INFO  L130       PetriNetUnfolder]: For 5726/5974 co-relation queries the response was YES.
[2021-12-21 15:07:22,350 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 1170 events. 221/1170 cut-off events. For 5726/5974 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9242 event pairs, 43 based on Foata normal form. 56/1192 useless extension candidates. Maximal degree in co-relation 4636. Up to 274 conditions per place. 
[2021-12-21 15:07:22,352 INFO  L132   encePairwiseOnDemand]: 102/114 looper letters, 44 selfloop transitions, 17 changer transitions 12/149 dead transitions.
[2021-12-21 15:07:22,352 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 149 transitions, 1082 flow
[2021-12-21 15:07:22,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-21 15:07:22,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-21 15:07:22,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1141 transitions.
[2021-12-21 15:07:22,354 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7699055330634278
[2021-12-21 15:07:22,354 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1141 transitions.
[2021-12-21 15:07:22,354 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1141 transitions.
[2021-12-21 15:07:22,355 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:22,355 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1141 transitions.
[2021-12-21 15:07:22,357 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 87.76923076923077) internal successors, (1141), 13 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,358 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,358 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,359 INFO  L186             Difference]: Start difference. First operand has 161 places, 120 transitions, 692 flow. Second operand 13 states and 1141 transitions.
[2021-12-21 15:07:22,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 149 transitions, 1082 flow
[2021-12-21 15:07:22,371 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 968 flow, removed 36 selfloop flow, removed 15 redundant places.
[2021-12-21 15:07:22,373 INFO  L242             Difference]: Finished difference. Result has 162 places, 125 transitions, 725 flow
[2021-12-21 15:07:22,373 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=725, PETRI_PLACES=162, PETRI_TRANSITIONS=125}
[2021-12-21 15:07:22,374 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places.
[2021-12-21 15:07:22,375 INFO  L470      AbstractCegarLoop]: Abstraction has has 162 places, 125 transitions, 725 flow
[2021-12-21 15:07:22,376 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,376 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:22,376 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]
[2021-12-21 15:07:22,376 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-12-21 15:07:22,376 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:22,376 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:22,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -167958605, now seen corresponding path program 2 times
[2021-12-21 15:07:22,377 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:22,377 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649928659]
[2021-12-21 15:07:22,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:22,377 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:22,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:22,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:22,527 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:22,527 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649928659]
[2021-12-21 15:07:22,527 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649928659] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:22,527 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:22,527 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-12-21 15:07:22,527 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335210348]
[2021-12-21 15:07:22,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:22,528 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-12-21 15:07:22,528 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:22,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-12-21 15:07:22,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2021-12-21 15:07:22,529 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114
[2021-12-21 15:07:22,530 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 125 transitions, 725 flow. Second operand  has 9 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,530 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:22,530 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114
[2021-12-21 15:07:22,530 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:22,890 INFO  L129       PetriNetUnfolder]: 245/1356 cut-off events.
[2021-12-21 15:07:22,890 INFO  L130       PetriNetUnfolder]: For 5225/5401 co-relation queries the response was YES.
[2021-12-21 15:07:22,895 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 1356 events. 245/1356 cut-off events. For 5225/5401 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11392 event pairs, 40 based on Foata normal form. 48/1366 useless extension candidates. Maximal degree in co-relation 4420. Up to 278 conditions per place. 
[2021-12-21 15:07:22,896 INFO  L132   encePairwiseOnDemand]: 103/114 looper letters, 43 selfloop transitions, 11 changer transitions 12/145 dead transitions.
[2021-12-21 15:07:22,897 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 145 transitions, 1053 flow
[2021-12-21 15:07:22,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-12-21 15:07:22,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2021-12-21 15:07:22,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1080 transitions.
[2021-12-21 15:07:22,898 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7894736842105263
[2021-12-21 15:07:22,898 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1080 transitions.
[2021-12-21 15:07:22,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1080 transitions.
[2021-12-21 15:07:22,899 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:22,899 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1080 transitions.
[2021-12-21 15:07:22,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 90.0) internal successors, (1080), 12 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,901 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,901 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,901 INFO  L186             Difference]: Start difference. First operand has 162 places, 125 transitions, 725 flow. Second operand 12 states and 1080 transitions.
[2021-12-21 15:07:22,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 145 transitions, 1053 flow
[2021-12-21 15:07:22,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 145 transitions, 988 flow, removed 26 selfloop flow, removed 9 redundant places.
[2021-12-21 15:07:22,908 INFO  L242             Difference]: Finished difference. Result has 165 places, 127 transitions, 764 flow
[2021-12-21 15:07:22,908 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=764, PETRI_PLACES=165, PETRI_TRANSITIONS=127}
[2021-12-21 15:07:22,909 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places.
[2021-12-21 15:07:22,909 INFO  L470      AbstractCegarLoop]: Abstraction has has 165 places, 127 transitions, 764 flow
[2021-12-21 15:07:22,909 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:22,909 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:22,909 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]
[2021-12-21 15:07:22,909 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-12-21 15:07:22,910 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:22,910 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:22,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 435034293, now seen corresponding path program 3 times
[2021-12-21 15:07:22,910 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:22,910 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476051065]
[2021-12-21 15:07:22,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:22,910 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:22,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:23,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:23,027 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:23,027 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476051065]
[2021-12-21 15:07:23,027 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476051065] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:23,027 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:23,027 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-21 15:07:23,028 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745230023]
[2021-12-21 15:07:23,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:23,028 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-21 15:07:23,028 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:23,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-21 15:07:23,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-21 15:07:23,030 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-21 15:07:23,031 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 127 transitions, 764 flow. Second operand  has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:23,031 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:23,031 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-21 15:07:23,031 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:23,402 INFO  L129       PetriNetUnfolder]: 374/1368 cut-off events.
[2021-12-21 15:07:23,402 INFO  L130       PetriNetUnfolder]: For 11046/11173 co-relation queries the response was YES.
[2021-12-21 15:07:23,408 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 1368 events. 374/1368 cut-off events. For 11046/11173 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10896 event pairs, 3 based on Foata normal form. 72/1431 useless extension candidates. Maximal degree in co-relation 5802. Up to 287 conditions per place. 
[2021-12-21 15:07:23,410 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 50 selfloop transitions, 12 changer transitions 46/185 dead transitions.
[2021-12-21 15:07:23,410 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 185 transitions, 1841 flow
[2021-12-21 15:07:23,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-21 15:07:23,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-21 15:07:23,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1032 transitions.
[2021-12-21 15:07:23,412 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8229665071770335
[2021-12-21 15:07:23,412 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1032 transitions.
[2021-12-21 15:07:23,412 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1032 transitions.
[2021-12-21 15:07:23,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:23,413 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1032 transitions.
[2021-12-21 15:07:23,414 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 93.81818181818181) internal successors, (1032), 11 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:23,415 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:23,415 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:23,415 INFO  L186             Difference]: Start difference. First operand has 165 places, 127 transitions, 764 flow. Second operand 11 states and 1032 transitions.
[2021-12-21 15:07:23,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 185 transitions, 1841 flow
[2021-12-21 15:07:23,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 1490 flow, removed 140 selfloop flow, removed 15 redundant places.
[2021-12-21 15:07:23,427 INFO  L242             Difference]: Finished difference. Result has 160 places, 123 transitions, 641 flow
[2021-12-21 15:07:23,427 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=641, PETRI_PLACES=160, PETRI_TRANSITIONS=123}
[2021-12-21 15:07:23,428 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places.
[2021-12-21 15:07:23,428 INFO  L470      AbstractCegarLoop]: Abstraction has has 160 places, 123 transitions, 641 flow
[2021-12-21 15:07:23,428 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:23,428 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:23,428 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]
[2021-12-21 15:07:23,428 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-12-21 15:07:23,428 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:23,429 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:23,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 1412627892, now seen corresponding path program 1 times
[2021-12-21 15:07:23,429 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:23,429 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080128844]
[2021-12-21 15:07:23,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:23,429 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:23,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:23,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:23,718 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:23,719 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080128844]
[2021-12-21 15:07:23,719 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080128844] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:23,719 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:23,719 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-12-21 15:07:23,719 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211855642]
[2021-12-21 15:07:23,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:23,719 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2021-12-21 15:07:23,719 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:23,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-12-21 15:07:23,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2021-12-21 15:07:23,721 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114
[2021-12-21 15:07:23,722 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 123 transitions, 641 flow. Second operand  has 17 states, 17 states have (on average 83.58823529411765) internal successors, (1421), 17 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:23,722 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:23,722 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114
[2021-12-21 15:07:23,722 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:24,043 INFO  L129       PetriNetUnfolder]: 95/674 cut-off events.
[2021-12-21 15:07:24,043 INFO  L130       PetriNetUnfolder]: For 2077/2192 co-relation queries the response was YES.
[2021-12-21 15:07:24,047 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 674 events. 95/674 cut-off events. For 2077/2192 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5018 event pairs, 2 based on Foata normal form. 18/675 useless extension candidates. Maximal degree in co-relation 2105. Up to 133 conditions per place. 
[2021-12-21 15:07:24,048 INFO  L132   encePairwiseOnDemand]: 97/114 looper letters, 32 selfloop transitions, 13 changer transitions 13/133 dead transitions.
[2021-12-21 15:07:24,048 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 133 transitions, 809 flow
[2021-12-21 15:07:24,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-12-21 15:07:24,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-12-21 15:07:24,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1275 transitions.
[2021-12-21 15:07:24,050 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7456140350877193
[2021-12-21 15:07:24,050 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1275 transitions.
[2021-12-21 15:07:24,050 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1275 transitions.
[2021-12-21 15:07:24,050 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:24,051 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1275 transitions.
[2021-12-21 15:07:24,052 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,053 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,054 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,054 INFO  L186             Difference]: Start difference. First operand has 160 places, 123 transitions, 641 flow. Second operand 15 states and 1275 transitions.
[2021-12-21 15:07:24,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 133 transitions, 809 flow
[2021-12-21 15:07:24,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 133 transitions, 685 flow, removed 43 selfloop flow, removed 18 redundant places.
[2021-12-21 15:07:24,062 INFO  L242             Difference]: Finished difference. Result has 158 places, 119 transitions, 522 flow
[2021-12-21 15:07:24,062 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=522, PETRI_PLACES=158, PETRI_TRANSITIONS=119}
[2021-12-21 15:07:24,062 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places.
[2021-12-21 15:07:24,062 INFO  L470      AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 522 flow
[2021-12-21 15:07:24,063 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 83.58823529411765) internal successors, (1421), 17 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,063 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:24,063 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]
[2021-12-21 15:07:24,063 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-12-21 15:07:24,063 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:24,064 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:24,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -531343430, now seen corresponding path program 2 times
[2021-12-21 15:07:24,064 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:24,064 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64207410]
[2021-12-21 15:07:24,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:24,064 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:24,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:24,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:24,270 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:24,270 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64207410]
[2021-12-21 15:07:24,270 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64207410] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:24,270 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:24,270 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-21 15:07:24,270 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082876026]
[2021-12-21 15:07:24,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:24,271 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-21 15:07:24,271 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:24,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-21 15:07:24,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2021-12-21 15:07:24,272 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-21 15:07:24,272 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 522 flow. Second operand  has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,272 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:24,273 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-21 15:07:24,273 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:24,526 INFO  L129       PetriNetUnfolder]: 93/662 cut-off events.
[2021-12-21 15:07:24,526 INFO  L130       PetriNetUnfolder]: For 841/890 co-relation queries the response was YES.
[2021-12-21 15:07:24,529 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 662 events. 93/662 cut-off events. For 841/890 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4847 event pairs, 2 based on Foata normal form. 9/654 useless extension candidates. Maximal degree in co-relation 1475. Up to 92 conditions per place. 
[2021-12-21 15:07:24,529 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 29 selfloop transitions, 15 changer transitions 13/132 dead transitions.
[2021-12-21 15:07:24,529 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 132 transitions, 736 flow
[2021-12-21 15:07:24,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-21 15:07:24,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-21 15:07:24,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 957 transitions.
[2021-12-21 15:07:24,531 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7631578947368421
[2021-12-21 15:07:24,531 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 957 transitions.
[2021-12-21 15:07:24,531 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 957 transitions.
[2021-12-21 15:07:24,531 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:24,531 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 957 transitions.
[2021-12-21 15:07:24,532 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,533 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,534 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,534 INFO  L186             Difference]: Start difference. First operand has 158 places, 119 transitions, 522 flow. Second operand 11 states and 957 transitions.
[2021-12-21 15:07:24,534 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 132 transitions, 736 flow
[2021-12-21 15:07:24,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 132 transitions, 662 flow, removed 22 selfloop flow, removed 15 redundant places.
[2021-12-21 15:07:24,538 INFO  L242             Difference]: Finished difference. Result has 151 places, 119 transitions, 523 flow
[2021-12-21 15:07:24,538 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=523, PETRI_PLACES=151, PETRI_TRANSITIONS=119}
[2021-12-21 15:07:24,538 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places.
[2021-12-21 15:07:24,538 INFO  L470      AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 523 flow
[2021-12-21 15:07:24,539 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,539 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:24,539 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]
[2021-12-21 15:07:24,539 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-12-21 15:07:24,539 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:24,539 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:24,539 INFO  L85        PathProgramCache]: Analyzing trace with hash -870122366, now seen corresponding path program 3 times
[2021-12-21 15:07:24,540 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:24,540 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847633247]
[2021-12-21 15:07:24,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:24,540 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:24,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:24,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:24,660 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:24,660 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847633247]
[2021-12-21 15:07:24,660 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847633247] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:24,660 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:24,660 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-21 15:07:24,660 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075359885]
[2021-12-21 15:07:24,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:24,660 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-21 15:07:24,660 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:24,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-21 15:07:24,661 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2021-12-21 15:07:24,661 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114
[2021-12-21 15:07:24,662 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 523 flow. Second operand  has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,662 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:24,662 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114
[2021-12-21 15:07:24,662 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:24,829 INFO  L129       PetriNetUnfolder]: 45/393 cut-off events.
[2021-12-21 15:07:24,829 INFO  L130       PetriNetUnfolder]: For 546/559 co-relation queries the response was YES.
[2021-12-21 15:07:24,831 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 906 conditions, 393 events. 45/393 cut-off events. For 546/559 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2146 event pairs, 2 based on Foata normal form. 9/395 useless extension candidates. Maximal degree in co-relation 881. Up to 65 conditions per place. 
[2021-12-21 15:07:24,831 INFO  L132   encePairwiseOnDemand]: 104/114 looper letters, 30 selfloop transitions, 9 changer transitions 14/132 dead transitions.
[2021-12-21 15:07:24,831 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 132 transitions, 743 flow
[2021-12-21 15:07:24,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-21 15:07:24,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-21 15:07:24,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 820 transitions.
[2021-12-21 15:07:24,833 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7992202729044834
[2021-12-21 15:07:24,833 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 820 transitions.
[2021-12-21 15:07:24,833 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 820 transitions.
[2021-12-21 15:07:24,833 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:24,833 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 820 transitions.
[2021-12-21 15:07:24,834 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,835 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:24,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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)
[2021-12-21 15:07:24,835 INFO  L186             Difference]: Start difference. First operand has 151 places, 119 transitions, 523 flow. Second operand 9 states and 820 transitions.
[2021-12-21 15:07:24,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 132 transitions, 743 flow
[2021-12-21 15:07:24,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 132 transitions, 681 flow, removed 18 selfloop flow, removed 11 redundant places.
[2021-12-21 15:07:24,839 INFO  L242             Difference]: Finished difference. Result has 149 places, 118 transitions, 499 flow
[2021-12-21 15:07:24,839 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=149, PETRI_TRANSITIONS=118}
[2021-12-21 15:07:24,839 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places.
[2021-12-21 15:07:24,839 INFO  L470      AbstractCegarLoop]: Abstraction has has 149 places, 118 transitions, 499 flow
[2021-12-21 15:07:24,840 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:24,840 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:24,840 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]
[2021-12-21 15:07:24,840 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-12-21 15:07:24,840 INFO  L402      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:24,840 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:24,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1328193492, now seen corresponding path program 4 times
[2021-12-21 15:07:24,840 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:24,840 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560029383]
[2021-12-21 15:07:24,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:24,841 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:24,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:25,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:25,022 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:25,022 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560029383]
[2021-12-21 15:07:25,022 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560029383] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:25,022 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:25,022 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-21 15:07:25,022 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315898557]
[2021-12-21 15:07:25,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:25,022 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-21 15:07:25,023 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:25,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-21 15:07:25,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2021-12-21 15:07:25,024 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-21 15:07:25,024 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 118 transitions, 499 flow. Second operand  has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,024 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:25,024 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-21 15:07:25,024 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:25,245 INFO  L129       PetriNetUnfolder]: 39/368 cut-off events.
[2021-12-21 15:07:25,245 INFO  L130       PetriNetUnfolder]: For 414/425 co-relation queries the response was YES.
[2021-12-21 15:07:25,247 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 807 conditions, 368 events. 39/368 cut-off events. For 414/425 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1953 event pairs, 0 based on Foata normal form. 8/371 useless extension candidates. Maximal degree in co-relation 783. Up to 44 conditions per place. 
[2021-12-21 15:07:25,247 INFO  L132   encePairwiseOnDemand]: 102/114 looper letters, 25 selfloop transitions, 10 changer transitions 20/131 dead transitions.
[2021-12-21 15:07:25,247 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 131 transitions, 708 flow
[2021-12-21 15:07:25,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-12-21 15:07:25,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2021-12-21 15:07:25,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1065 transitions.
[2021-12-21 15:07:25,249 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7785087719298246
[2021-12-21 15:07:25,249 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1065 transitions.
[2021-12-21 15:07:25,249 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1065 transitions.
[2021-12-21 15:07:25,250 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:25,250 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1065 transitions.
[2021-12-21 15:07:25,251 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 88.75) internal successors, (1065), 12 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,252 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,253 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,253 INFO  L186             Difference]: Start difference. First operand has 149 places, 118 transitions, 499 flow. Second operand 12 states and 1065 transitions.
[2021-12-21 15:07:25,253 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 131 transitions, 708 flow
[2021-12-21 15:07:25,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 131 transitions, 618 flow, removed 24 selfloop flow, removed 11 redundant places.
[2021-12-21 15:07:25,256 INFO  L242             Difference]: Finished difference. Result has 149 places, 111 transitions, 414 flow
[2021-12-21 15:07:25,256 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=414, PETRI_PLACES=149, PETRI_TRANSITIONS=111}
[2021-12-21 15:07:25,257 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places.
[2021-12-21 15:07:25,257 INFO  L470      AbstractCegarLoop]: Abstraction has has 149 places, 111 transitions, 414 flow
[2021-12-21 15:07:25,257 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,257 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:25,258 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]
[2021-12-21 15:07:25,258 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-12-21 15:07:25,258 INFO  L402      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:25,258 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:25,258 INFO  L85        PathProgramCache]: Analyzing trace with hash -1544419612, now seen corresponding path program 5 times
[2021-12-21 15:07:25,258 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:25,259 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832755073]
[2021-12-21 15:07:25,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:25,259 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:25,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-21 15:07:25,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-21 15:07:25,427 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-21 15:07:25,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832755073]
[2021-12-21 15:07:25,427 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832755073] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-21 15:07:25,427 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-21 15:07:25,427 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-21 15:07:25,427 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372193424]
[2021-12-21 15:07:25,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-21 15:07:25,428 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-21 15:07:25,428 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-21 15:07:25,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-21 15:07:25,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2021-12-21 15:07:25,429 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-21 15:07:25,429 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 111 transitions, 414 flow. Second operand  has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,429 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-21 15:07:25,430 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-21 15:07:25,430 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-21 15:07:25,608 INFO  L129       PetriNetUnfolder]: 29/287 cut-off events.
[2021-12-21 15:07:25,609 INFO  L130       PetriNetUnfolder]: For 154/157 co-relation queries the response was YES.
[2021-12-21 15:07:25,609 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 577 conditions, 287 events. 29/287 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1255 event pairs, 0 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 554. Up to 34 conditions per place. 
[2021-12-21 15:07:25,610 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 23 selfloop transitions, 3 changer transitions 21/123 dead transitions.
[2021-12-21 15:07:25,610 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 123 transitions, 598 flow
[2021-12-21 15:07:25,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-21 15:07:25,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-21 15:07:25,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 891 transitions.
[2021-12-21 15:07:25,611 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.781578947368421
[2021-12-21 15:07:25,611 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 891 transitions.
[2021-12-21 15:07:25,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 891 transitions.
[2021-12-21 15:07:25,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-21 15:07:25,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 891 transitions.
[2021-12-21 15:07:25,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,616 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,617 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,617 INFO  L186             Difference]: Start difference. First operand has 149 places, 111 transitions, 414 flow. Second operand 10 states and 891 transitions.
[2021-12-21 15:07:25,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 123 transitions, 598 flow
[2021-12-21 15:07:25,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 524 flow, removed 15 selfloop flow, removed 15 redundant places.
[2021-12-21 15:07:25,620 INFO  L242             Difference]: Finished difference. Result has 138 places, 102 transitions, 302 flow
[2021-12-21 15:07:25,620 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=138, PETRI_TRANSITIONS=102}
[2021-12-21 15:07:25,621 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places.
[2021-12-21 15:07:25,621 INFO  L470      AbstractCegarLoop]: Abstraction has has 138 places, 102 transitions, 302 flow
[2021-12-21 15:07:25,621 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-21 15:07:25,621 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-21 15:07:25,621 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]
[2021-12-21 15:07:25,621 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-12-21 15:07:25,621 INFO  L402      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-21 15:07:25,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-21 15:07:25,621 INFO  L85        PathProgramCache]: Analyzing trace with hash -227522288, now seen corresponding path program 6 times
[2021-12-21 15:07:25,622 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-21 15:07:25,622 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824432908]
[2021-12-21 15:07:25,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-21 15:07:25,622 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-21 15:07:25,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-21 15:07:25,666 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-21 15:07:25,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-21 15:07:25,765 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-21 15:07:25,765 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2021-12-21 15:07:25,766 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2021-12-21 15:07:25,769 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2021-12-21 15:07:25,769 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2021-12-21 15:07:25,769 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2021-12-21 15:07:25,769 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2021-12-21 15:07:25,769 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2021-12-21 15:07:25,770 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2021-12-21 15:07:25,772 INFO  L732         BasicCegarLoop]: Path program histogram: [6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2021-12-21 15:07:25,777 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-12-21 15:07:25,777 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-12-21 15:07:25,878 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:07:25 BasicIcfg
[2021-12-21 15:07:25,879 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-12-21 15:07:25,883 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-12-21 15:07:25,883 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-12-21 15:07:25,883 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-12-21 15:07:25,884 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:07:09" (3/4) ...
[2021-12-21 15:07:25,885 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-12-21 15:07:26,006 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-12-21 15:07:26,007 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-12-21 15:07:26,007 INFO  L158              Benchmark]: Toolchain (without parser) took 17907.94ms. Allocated memory was 113.2MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 85.8MB in the beginning and 614.9MB in the end (delta: -529.1MB). Peak memory consumption was 357.8MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,007 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2021-12-21 15:07:26,008 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 465.76ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 85.8MB in the beginning and 111.6MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,008 INFO  L158              Benchmark]: Boogie Procedure Inliner took 55.26ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 108.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,008 INFO  L158              Benchmark]: Boogie Preprocessor took 76.36ms. Allocated memory is still 151.0MB. Free memory was 108.1MB in the beginning and 105.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,008 INFO  L158              Benchmark]: RCFGBuilder took 1119.23ms. Allocated memory is still 151.0MB. Free memory was 105.3MB in the beginning and 97.3MB in the end (delta: 8.1MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,009 INFO  L158              Benchmark]: TraceAbstraction took 16058.73ms. Allocated memory was 151.0MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 96.2MB in the beginning and 655.8MB in the end (delta: -559.5MB). Peak memory consumption was 290.9MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,009 INFO  L158              Benchmark]: Witness Printer took 123.70ms. Allocated memory is still 1.0GB. Free memory was 655.8MB in the beginning and 614.9MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB.
[2021-12-21 15:07:26,010 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.19ms. Allocated memory is still 113.2MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 465.76ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 85.8MB in the beginning and 111.6MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 55.26ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 108.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 76.36ms. Allocated memory is still 151.0MB. Free memory was 108.1MB in the beginning and 105.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1119.23ms. Allocated memory is still 151.0MB. Free memory was 105.3MB in the beginning and 97.3MB in the end (delta: 8.1MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 16058.73ms. Allocated memory was 151.0MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 96.2MB in the beginning and 655.8MB in the end (delta: -559.5MB). Peak memory consumption was 290.9MB. Max. memory is 16.1GB.
 * Witness Printer took 123.70ms. Allocated memory is still 1.0GB. Free memory was 655.8MB in the beginning and 614.9MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB.
 * 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_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L715]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0]
[L716]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L718]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L719]               0  _Bool x$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L720]               0  int x$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L721]               0  _Bool x$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L722]               0  _Bool x$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L723]               0  _Bool x$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L724]               0  _Bool x$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L725]               0  _Bool x$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0]
[L726]               0  _Bool x$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L727]               0  _Bool x$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L728]               0  _Bool x$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L729]               0  _Bool x$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0]
[L730]               0  int *x$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L731]               0  int x$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L732]               0  _Bool x$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L733]               0  int x$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L734]               0  _Bool x$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L736]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L737]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L738]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L849]               0  pthread_t t2537;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L850]  FCALL, FORK  0  pthread_create(&t2537, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L851]               0  pthread_t t2538;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L852]  FCALL, FORK  0  pthread_create(&t2538, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L853]               0  pthread_t t2539;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L854]  FCALL, FORK  0  pthread_create(&t2539, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L812]               3  x$w_buff1 = x$w_buff0
[L813]               3  x$w_buff0 = 2
[L814]               3  x$w_buff1_used = x$w_buff0_used
[L815]               3  x$w_buff0_used = (_Bool)1
[L816]  CALL         3  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   3  !(!expression)
[L816]  RET          3  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L817]               3  x$r_buff1_thd0 = x$r_buff0_thd0
[L818]               3  x$r_buff1_thd1 = x$r_buff0_thd1
[L819]               3  x$r_buff1_thd2 = x$r_buff0_thd2
[L820]               3  x$r_buff1_thd3 = x$r_buff0_thd3
[L821]               3  x$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L824]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L742]               1  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L747]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L748]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L749]               1  x$flush_delayed = weak$$choice2
[L750]               1  x$mem_tmp = x
[L751]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L751]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L752]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L752]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L753]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L753]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L754]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L754]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L755]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L755]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)
[L756]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L757]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L757]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758]               1  __unbuffered_p0_EAX = x
[L759]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L759]               1  x = x$flush_delayed ? x$mem_tmp : x
[L760]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=69, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L772]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=69, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L775]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L775]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L775]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L775]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L776]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L776]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L777]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L777]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L778]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L779]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L783]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L784]               2  x$flush_delayed = weak$$choice2
[L785]               2  x$mem_tmp = x
[L786]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L786]               2  x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L787]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L787]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)
[L787]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L787]               2  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L788]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L788]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)
[L788]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L788]               2  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L789]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L789]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)
[L789]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L789]               2  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L790]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L790]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]               2  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L791]  EXPR         2  weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L791]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)
[L791]  EXPR         2  weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L791]               2  x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L792]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L792]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L792]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L792]               2  x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L793]               2  __unbuffered_p1_EAX = x
[L794]  EXPR         2  x$flush_delayed ? x$mem_tmp : x
[L794]               2  x = x$flush_delayed ? x$mem_tmp : x
[L795]               2  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L798]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L798]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L799]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L799]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L800]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L800]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L801]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L801]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L802]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L802]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L827]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L827]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L828]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L828]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L829]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L829]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L830]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L830]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L831]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L831]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L765]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L805]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L834]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L856]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L858]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L858]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L860]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L860]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L860]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L860]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L861]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L861]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L862]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L862]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L863]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L863]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L864]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L864]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L867]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L868]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L869]               0  x$flush_delayed = weak$$choice2
[L870]               0  x$mem_tmp = x
[L871]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L871]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L872]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L872]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L872]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L872]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L873]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L873]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L873]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L873]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L874]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L874]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L874]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L874]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L875]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L875]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L876]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)
[L876]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L876]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L877]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L877]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L878]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1)
[L879]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L879]               0  x = x$flush_delayed ? x$mem_tmp : x
[L880]               0  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L882]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L19]                0  reach_error()
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]

  - 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: 850]: 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: 854]: 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: 852]: 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, 141 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: 15.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1075 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1075 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2118 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4213 IncrementalHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 245 mSDtfsCounter, 4213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1156occurred in iteration=12, InterpolantAutomatonStates: 282, 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.9s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 11795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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!
[2021-12-21 15:07:26,048 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE