./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe023_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 ae007674
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/safe023_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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-ae00767
[2021-12-28 02:51:31,109 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-28 02:51:31,111 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-28 02:51:31,146 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-28 02:51:31,147 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-28 02:51:31,148 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-28 02:51:31,149 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-28 02:51:31,155 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-28 02:51:31,157 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-28 02:51:31,160 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-28 02:51:31,162 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-28 02:51:31,165 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-28 02:51:31,165 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-28 02:51:31,167 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-28 02:51:31,168 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-28 02:51:31,169 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-28 02:51:31,170 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-28 02:51:31,171 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-28 02:51:31,173 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-28 02:51:31,176 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-28 02:51:31,177 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-28 02:51:31,178 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-28 02:51:31,179 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-28 02:51:31,180 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-28 02:51:31,185 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-28 02:51:31,186 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-28 02:51:31,186 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-28 02:51:31,187 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-28 02:51:31,188 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-28 02:51:31,188 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-28 02:51:31,188 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-28 02:51:31,189 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-28 02:51:31,189 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-28 02:51:31,190 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-28 02:51:31,190 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-28 02:51:31,191 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-28 02:51:31,191 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-28 02:51:31,191 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-28 02:51:31,192 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-28 02:51:31,192 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-28 02:51:31,193 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-28 02:51:31,193 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-12-28 02:51:31,208 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-28 02:51:31,208 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-28 02:51:31,208 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-28 02:51:31,208 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-28 02:51:31,209 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-28 02:51:31,209 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-28 02:51:31,209 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-28 02:51:31,209 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-28 02:51:31,210 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-28 02:51:31,210 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-12-28 02:51:31,211 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-12-28 02:51:31,211 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-28 02:51:31,211 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-28 02:51:31,212 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-12-28 02:51:31,212 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-28 02:51:31,212 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-28 02:51:31,213 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-12-28 02:51:31,213 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-28 02:51:31,213 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-28 02:51:31,213 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-12-28 02:51:31,213 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-12-28 02:51:31,214 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-28 02:51:31,214 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-28 02:51:31,214 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-12-28 02:51:31,214 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-12-28 02:51:31,215 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-12-28 02:51:31,215 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687
[2021-12-28 02:51:31,468 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-28 02:51:31,482 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-28 02:51:31,484 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-28 02:51:31,484 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-28 02:51:31,485 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-28 02:51:31,486 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-28 02:51:31,528 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fedb8d2fe/d8c0907806d44d388d79d1a166b6c6bc/FLAG3a00462f5
[2021-12-28 02:51:31,990 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-28 02:51:31,991 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-28 02:51:32,015 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fedb8d2fe/d8c0907806d44d388d79d1a166b6c6bc/FLAG3a00462f5
[2021-12-28 02:51:32,332 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fedb8d2fe/d8c0907806d44d388d79d1a166b6c6bc
[2021-12-28 02:51:32,334 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-28 02:51:32,335 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-28 02:51:32,338 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-28 02:51:32,338 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-28 02:51:32,340 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-28 02:51:32,341 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,341 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b521486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32, skipping insertion in model container
[2021-12-28 02:51:32,341 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,346 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-28 02:51:32,391 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-28 02:51:32,489 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2021-12-28 02:51:32,678 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-28 02:51:32,683 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-28 02:51:32,690 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2021-12-28 02:51:32,747 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-28 02:51:32,775 INFO  L208         MainTranslator]: Completed translation
[2021-12-28 02:51:32,775 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32 WrapperNode
[2021-12-28 02:51:32,775 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-28 02:51:32,777 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-28 02:51:32,777 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-28 02:51:32,777 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-28 02:51:32,781 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,810 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,835 INFO  L137                Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275
[2021-12-28 02:51:32,836 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-28 02:51:32,836 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-28 02:51:32,837 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-28 02:51:32,837 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-28 02:51:32,848 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,848 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,851 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,852 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,867 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,871 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,874 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,894 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-28 02:51:32,895 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-28 02:51:32,895 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-28 02:51:32,895 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-28 02:51:32,896 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (1/1) ...
[2021-12-28 02:51:32,901 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-28 02:51:32,911 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-28 02:51:32,932 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-28 02:51:32,939 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-28 02:51:32,959 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-28 02:51:32,959 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-12-28 02:51:32,959 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-28 02:51:32,959 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-28 02:51:32,959 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-28 02:51:32,960 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-12-28 02:51:32,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-12-28 02:51:32,961 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-12-28 02:51:32,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-12-28 02:51:32,961 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-12-28 02:51:32,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-12-28 02:51:32,961 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-12-28 02:51:32,962 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-12-28 02:51:32,962 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-28 02:51:32,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-28 02:51:32,963 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-12-28 02:51:33,115 INFO  L234             CfgBuilder]: Building ICFG
[2021-12-28 02:51:33,118 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-28 02:51:33,680 INFO  L275             CfgBuilder]: Performing block encoding
[2021-12-28 02:51:34,030 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-28 02:51:34,031 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2021-12-28 02:51:34,033 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:51:34 BoogieIcfgContainer
[2021-12-28 02:51:34,033 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-28 02:51:34,035 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-28 02:51:34,035 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-12-28 02:51:34,037 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-12-28 02:51:34,037 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:51:32" (1/3) ...
[2021-12-28 02:51:34,037 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4601b328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:51:34, skipping insertion in model container
[2021-12-28 02:51:34,037 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:51:32" (2/3) ...
[2021-12-28 02:51:34,038 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4601b328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:51:34, skipping insertion in model container
[2021-12-28 02:51:34,038 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:51:34" (3/3) ...
[2021-12-28 02:51:34,039 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2021-12-28 02:51:34,043 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-12-28 02:51:34,043 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-28 02:51:34,043 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-12-28 02:51:34,043 INFO  L513   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-12-28 02:51:34,091 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,092 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,092 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,092 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,092 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,092 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,093 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,093 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,093 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,093 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,093 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,094 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,094 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,094 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,094 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,094 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,094 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,095 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,095 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,095 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,095 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,095 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,096 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,096 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,096 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,096 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,097 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,098 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,099 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,101 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,101 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,101 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,101 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,101 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,102 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,103 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,103 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,103 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,103 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,103 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,103 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,104 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,105 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,106 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,106 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,106 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,107 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,107 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,107 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,107 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,107 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,110 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,111 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,113 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,114 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,115 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,116 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,117 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,118 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,119 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,120 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,120 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,120 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,121 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,121 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,121 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,122 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,123 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,124 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,126 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,127 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,127 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,127 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,127 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,130 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,131 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,136 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,138 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,139 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,140 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,140 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,142 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,143 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,144 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,144 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,144 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,144 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,145 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,146 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,147 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,148 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-28 02:51:34,149 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-12-28 02:51:34,212 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-28 02:51:34,224 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-28 02:51:34,224 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-12-28 02:51:34,234 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow
[2021-12-28 02:51:34,262 INFO  L129       PetriNetUnfolder]: 2/113 cut-off events.
[2021-12-28 02:51:34,262 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-28 02:51:34,266 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. 
[2021-12-28 02:51:34,266 INFO  L82        GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow
[2021-12-28 02:51:34,277 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow
[2021-12-28 02:51:34,290 INFO  L129       PetriNetUnfolder]: 0/61 cut-off events.
[2021-12-28 02:51:34,290 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-28 02:51:34,290 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:34,290 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]
[2021-12-28 02:51:34,291 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:34,294 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:34,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -16800889, now seen corresponding path program 1 times
[2021-12-28 02:51:34,299 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:34,299 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410395268]
[2021-12-28 02:51:34,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:34,300 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:34,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:34,487 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-28 02:51:34,487 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:34,487 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410395268]
[2021-12-28 02:51:34,488 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410395268] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:34,488 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:34,488 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-28 02:51:34,489 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311478587]
[2021-12-28 02:51:34,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:34,495 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-28 02:51:34,496 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:34,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-28 02:51:34,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-28 02:51:34,526 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116
[2021-12-28 02:51:34,530 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:34,530 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:34,530 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116
[2021-12-28 02:51:34,531 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:34,777 INFO  L129       PetriNetUnfolder]: 210/818 cut-off events.
[2021-12-28 02:51:34,777 INFO  L130       PetriNetUnfolder]: For 17/17 co-relation queries the response was YES.
[2021-12-28 02:51:34,780 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 818 events. 210/818 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5120 event pairs, 46 based on Foata normal form. 39/810 useless extension candidates. Maximal degree in co-relation 1140. Up to 245 conditions per place. 
[2021-12-28 02:51:34,784 INFO  L132   encePairwiseOnDemand]: 111/116 looper letters, 19 selfloop transitions, 2 changer transitions 0/117 dead transitions.
[2021-12-28 02:51:34,784 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 288 flow
[2021-12-28 02:51:34,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-12-28 02:51:34,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-12-28 02:51:34,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions.
[2021-12-28 02:51:34,800 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9281609195402298
[2021-12-28 02:51:34,800 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 323 transitions.
[2021-12-28 02:51:34,801 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions.
[2021-12-28 02:51:34,804 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:34,805 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions.
[2021-12-28 02:51:34,810 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:34,815 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:34,815 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:34,817 INFO  L186             Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 323 transitions.
[2021-12-28 02:51:34,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 288 flow
[2021-12-28 02:51:34,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-12-28 02:51:34,823 INFO  L242             Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow
[2021-12-28 02:51:34,825 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109}
[2021-12-28 02:51:34,829 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places.
[2021-12-28 02:51:34,830 INFO  L470      AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow
[2021-12-28 02:51:34,830 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:34,830 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:34,830 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]
[2021-12-28 02:51:34,830 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-12-28 02:51:34,831 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:34,831 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:34,831 INFO  L85        PathProgramCache]: Analyzing trace with hash 659796401, now seen corresponding path program 1 times
[2021-12-28 02:51:34,831 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:34,832 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274684301]
[2021-12-28 02:51:34,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:34,832 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:34,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:35,036 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-28 02:51:35,036 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:35,036 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274684301]
[2021-12-28 02:51:35,036 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274684301] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:35,037 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:35,037 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-28 02:51:35,040 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540413332]
[2021-12-28 02:51:35,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:35,042 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-28 02:51:35,042 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:35,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-28 02:51:35,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-28 02:51:35,044 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116
[2021-12-28 02:51:35,046 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand  has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:35,047 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:35,047 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116
[2021-12-28 02:51:35,047 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:35,534 INFO  L129       PetriNetUnfolder]: 690/1888 cut-off events.
[2021-12-28 02:51:35,534 INFO  L130       PetriNetUnfolder]: For 124/124 co-relation queries the response was YES.
[2021-12-28 02:51:35,538 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1888 events. 690/1888 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13603 event pairs, 312 based on Foata normal form. 0/1820 useless extension candidates. Maximal degree in co-relation 3066. Up to 429 conditions per place. 
[2021-12-28 02:51:35,542 INFO  L132   encePairwiseOnDemand]: 110/116 looper letters, 23 selfloop transitions, 2 changer transitions 54/158 dead transitions.
[2021-12-28 02:51:35,543 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 158 transitions, 480 flow
[2021-12-28 02:51:35,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-28 02:51:35,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-28 02:51:35,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 907 transitions.
[2021-12-28 02:51:35,546 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8687739463601533
[2021-12-28 02:51:35,546 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 907 transitions.
[2021-12-28 02:51:35,546 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 907 transitions.
[2021-12-28 02:51:35,547 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:35,547 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 907 transitions.
[2021-12-28 02:51:35,549 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:35,552 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:35,552 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:35,552 INFO  L186             Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 907 transitions.
[2021-12-28 02:51:35,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 158 transitions, 480 flow
[2021-12-28 02:51:35,555 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 158 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-12-28 02:51:35,558 INFO  L242             Difference]: Finished difference. Result has 131 places, 97 transitions, 220 flow
[2021-12-28 02:51:35,558 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=131, PETRI_TRANSITIONS=97}
[2021-12-28 02:51:35,559 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2021-12-28 02:51:35,559 INFO  L470      AbstractCegarLoop]: Abstraction has has 131 places, 97 transitions, 220 flow
[2021-12-28 02:51:35,559 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:35,559 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:35,560 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]
[2021-12-28 02:51:35,560 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-12-28 02:51:35,560 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:35,561 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:35,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -726916817, now seen corresponding path program 1 times
[2021-12-28 02:51:35,561 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:35,561 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911371212]
[2021-12-28 02:51:35,561 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:35,561 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:35,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:35,771 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-28 02:51:35,772 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:35,772 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911371212]
[2021-12-28 02:51:35,772 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911371212] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:35,773 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:35,773 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-28 02:51:35,773 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168068908]
[2021-12-28 02:51:35,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:35,774 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-28 02:51:35,774 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:35,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-28 02:51:35,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-28 02:51:35,776 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116
[2021-12-28 02:51:35,777 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 97 transitions, 220 flow. Second operand  has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:35,777 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:35,777 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116
[2021-12-28 02:51:35,777 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:36,128 INFO  L129       PetriNetUnfolder]: 512/1064 cut-off events.
[2021-12-28 02:51:36,128 INFO  L130       PetriNetUnfolder]: For 256/256 co-relation queries the response was YES.
[2021-12-28 02:51:36,130 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1064 events. 512/1064 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5693 event pairs, 103 based on Foata normal form. 24/1042 useless extension candidates. Maximal degree in co-relation 2146. Up to 466 conditions per place. 
[2021-12-28 02:51:36,134 INFO  L132   encePairwiseOnDemand]: 110/116 looper letters, 23 selfloop transitions, 2 changer transitions 34/137 dead transitions.
[2021-12-28 02:51:36,134 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 137 transitions, 439 flow
[2021-12-28 02:51:36,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-28 02:51:36,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-28 02:51:36,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions.
[2021-12-28 02:51:36,136 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8515325670498084
[2021-12-28 02:51:36,136 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 889 transitions.
[2021-12-28 02:51:36,136 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions.
[2021-12-28 02:51:36,137 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:36,137 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions.
[2021-12-28 02:51:36,139 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-28 02:51:36,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,141 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,141 INFO  L186             Difference]: Start difference. First operand has 131 places, 97 transitions, 220 flow. Second operand 9 states and 889 transitions.
[2021-12-28 02:51:36,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 137 transitions, 439 flow
[2021-12-28 02:51:36,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 137 transitions, 405 flow, removed 14 selfloop flow, removed 8 redundant places.
[2021-12-28 02:51:36,151 INFO  L242             Difference]: Finished difference. Result has 120 places, 97 transitions, 224 flow
[2021-12-28 02:51:36,151 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=120, PETRI_TRANSITIONS=97}
[2021-12-28 02:51:36,152 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, -1 predicate places.
[2021-12-28 02:51:36,152 INFO  L470      AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 224 flow
[2021-12-28 02:51:36,153 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,153 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:36,153 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-28 02:51:36,153 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-12-28 02:51:36,153 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:36,154 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:36,154 INFO  L85        PathProgramCache]: Analyzing trace with hash -74082386, now seen corresponding path program 1 times
[2021-12-28 02:51:36,154 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:36,154 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200939162]
[2021-12-28 02:51:36,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:36,154 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:36,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:36,363 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-28 02:51:36,363 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:36,363 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200939162]
[2021-12-28 02:51:36,363 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200939162] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:36,363 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:36,363 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-28 02:51:36,364 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809980100]
[2021-12-28 02:51:36,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:36,364 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-28 02:51:36,364 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:36,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-28 02:51:36,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-12-28 02:51:36,365 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116
[2021-12-28 02:51:36,366 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 224 flow. Second operand  has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,366 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:36,366 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116
[2021-12-28 02:51:36,366 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:36,731 INFO  L129       PetriNetUnfolder]: 604/1340 cut-off events.
[2021-12-28 02:51:36,731 INFO  L130       PetriNetUnfolder]: For 293/293 co-relation queries the response was YES.
[2021-12-28 02:51:36,734 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 1340 events. 604/1340 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7879 event pairs, 170 based on Foata normal form. 24/1285 useless extension candidates. Maximal degree in co-relation 2645. Up to 293 conditions per place. 
[2021-12-28 02:51:36,736 INFO  L132   encePairwiseOnDemand]: 108/116 looper letters, 27 selfloop transitions, 4 changer transitions 40/147 dead transitions.
[2021-12-28 02:51:36,736 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 147 transitions, 497 flow
[2021-12-28 02:51:36,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-28 02:51:36,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-28 02:51:36,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions.
[2021-12-28 02:51:36,739 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8387931034482758
[2021-12-28 02:51:36,739 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 973 transitions.
[2021-12-28 02:51:36,739 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions.
[2021-12-28 02:51:36,739 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:36,739 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions.
[2021-12-28 02:51:36,742 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,743 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,743 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,743 INFO  L186             Difference]: Start difference. First operand has 120 places, 97 transitions, 224 flow. Second operand 10 states and 973 transitions.
[2021-12-28 02:51:36,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 147 transitions, 497 flow
[2021-12-28 02:51:36,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 147 transitions, 463 flow, removed 14 selfloop flow, removed 8 redundant places.
[2021-12-28 02:51:36,751 INFO  L242             Difference]: Finished difference. Result has 123 places, 97 transitions, 238 flow
[2021-12-28 02:51:36,751 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=97}
[2021-12-28 02:51:36,752 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places.
[2021-12-28 02:51:36,752 INFO  L470      AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 238 flow
[2021-12-28 02:51:36,752 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:36,752 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:36,752 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-28 02:51:36,752 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-12-28 02:51:36,752 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:36,753 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:36,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217105744, now seen corresponding path program 1 times
[2021-12-28 02:51:36,753 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:36,753 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397305529]
[2021-12-28 02:51:36,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:36,754 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:36,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:37,032 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-28 02:51:37,032 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:37,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397305529]
[2021-12-28 02:51:37,032 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397305529] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:37,032 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:37,032 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-28 02:51:37,032 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573934637]
[2021-12-28 02:51:37,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:37,033 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-28 02:51:37,033 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:37,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-28 02:51:37,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2021-12-28 02:51:37,035 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116
[2021-12-28 02:51:37,036 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 238 flow. Second operand  has 13 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:37,036 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:37,036 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116
[2021-12-28 02:51:37,036 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:37,678 INFO  L129       PetriNetUnfolder]: 548/1335 cut-off events.
[2021-12-28 02:51:37,678 INFO  L130       PetriNetUnfolder]: For 540/546 co-relation queries the response was YES.
[2021-12-28 02:51:37,681 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1335 events. 548/1335 cut-off events. For 540/546 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7980 event pairs, 132 based on Foata normal form. 34/1281 useless extension candidates. Maximal degree in co-relation 2685. Up to 408 conditions per place. 
[2021-12-28 02:51:37,684 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 33 selfloop transitions, 12 changer transitions 47/164 dead transitions.
[2021-12-28 02:51:37,684 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 164 transitions, 604 flow
[2021-12-28 02:51:37,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-12-28 02:51:37,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-12-28 02:51:37,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1557 transitions.
[2021-12-28 02:51:37,687 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.789553752535497
[2021-12-28 02:51:37,687 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1557 transitions.
[2021-12-28 02:51:37,688 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1557 transitions.
[2021-12-28 02:51:37,688 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:37,688 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1557 transitions.
[2021-12-28 02:51:37,690 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 91.58823529411765) internal successors, (1557), 17 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:37,692 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 116.0) internal successors, (2088), 18 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:37,693 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 116.0) internal successors, (2088), 18 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:37,693 INFO  L186             Difference]: Start difference. First operand has 123 places, 97 transitions, 238 flow. Second operand 17 states and 1557 transitions.
[2021-12-28 02:51:37,693 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 164 transitions, 604 flow
[2021-12-28 02:51:37,697 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 164 transitions, 546 flow, removed 24 selfloop flow, removed 10 redundant places.
[2021-12-28 02:51:37,699 INFO  L242             Difference]: Finished difference. Result has 135 places, 105 transitions, 302 flow
[2021-12-28 02:51:37,699 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=302, PETRI_PLACES=135, PETRI_TRANSITIONS=105}
[2021-12-28 02:51:37,701 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places.
[2021-12-28 02:51:37,701 INFO  L470      AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 302 flow
[2021-12-28 02:51:37,701 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:37,701 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:37,701 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-28 02:51:37,702 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-12-28 02:51:37,702 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:37,702 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:37,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -1919193934, now seen corresponding path program 2 times
[2021-12-28 02:51:37,702 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:37,702 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616374055]
[2021-12-28 02:51:37,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:37,703 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:37,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:37,932 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-28 02:51:37,932 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:37,932 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616374055]
[2021-12-28 02:51:37,933 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616374055] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:37,933 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:37,933 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-28 02:51:37,933 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027832191]
[2021-12-28 02:51:37,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:37,934 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-28 02:51:37,934 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:37,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-28 02:51:37,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2021-12-28 02:51:37,936 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116
[2021-12-28 02:51:37,938 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 302 flow. Second operand  has 13 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:37,938 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:37,938 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116
[2021-12-28 02:51:37,938 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:38,422 INFO  L129       PetriNetUnfolder]: 418/1088 cut-off events.
[2021-12-28 02:51:38,422 INFO  L130       PetriNetUnfolder]: For 842/917 co-relation queries the response was YES.
[2021-12-28 02:51:38,425 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 1088 events. 418/1088 cut-off events. For 842/917 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6736 event pairs, 52 based on Foata normal form. 19/1043 useless extension candidates. Maximal degree in co-relation 2614. Up to 516 conditions per place. 
[2021-12-28 02:51:38,429 INFO  L132   encePairwiseOnDemand]: 99/116 looper letters, 36 selfloop transitions, 18 changer transitions 28/155 dead transitions.
[2021-12-28 02:51:38,429 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 155 transitions, 665 flow
[2021-12-28 02:51:38,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-12-28 02:51:38,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-12-28 02:51:38,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1382 transitions.
[2021-12-28 02:51:38,432 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7942528735632184
[2021-12-28 02:51:38,432 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1382 transitions.
[2021-12-28 02:51:38,432 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1382 transitions.
[2021-12-28 02:51:38,433 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:38,433 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1382 transitions.
[2021-12-28 02:51:38,435 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 92.13333333333334) internal successors, (1382), 15 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:38,437 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:38,437 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:38,437 INFO  L186             Difference]: Start difference. First operand has 135 places, 105 transitions, 302 flow. Second operand 15 states and 1382 transitions.
[2021-12-28 02:51:38,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 155 transitions, 665 flow
[2021-12-28 02:51:38,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 155 transitions, 615 flow, removed 21 selfloop flow, removed 13 redundant places.
[2021-12-28 02:51:38,442 INFO  L242             Difference]: Finished difference. Result has 135 places, 116 transitions, 422 flow
[2021-12-28 02:51:38,442 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=422, PETRI_PLACES=135, PETRI_TRANSITIONS=116}
[2021-12-28 02:51:38,443 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places.
[2021-12-28 02:51:38,443 INFO  L470      AbstractCegarLoop]: Abstraction has has 135 places, 116 transitions, 422 flow
[2021-12-28 02:51:38,443 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:38,443 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:38,443 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-28 02:51:38,444 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-12-28 02:51:38,444 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:38,444 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:38,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 832797035, now seen corresponding path program 1 times
[2021-12-28 02:51:38,444 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:38,444 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198568844]
[2021-12-28 02:51:38,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:38,445 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:38,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:38,552 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-28 02:51:38,552 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:38,552 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198568844]
[2021-12-28 02:51:38,552 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198568844] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:38,552 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:38,553 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-28 02:51:38,553 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655186397]
[2021-12-28 02:51:38,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:38,555 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-28 02:51:38,555 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:38,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-28 02:51:38,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-28 02:51:38,556 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2021-12-28 02:51:38,556 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 116 transitions, 422 flow. Second operand  has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:38,556 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:38,556 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2021-12-28 02:51:38,556 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:39,466 INFO  L129       PetriNetUnfolder]: 3299/6093 cut-off events.
[2021-12-28 02:51:39,466 INFO  L130       PetriNetUnfolder]: For 15184/15652 co-relation queries the response was YES.
[2021-12-28 02:51:39,480 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 19038 conditions, 6093 events. 3299/6093 cut-off events. For 15184/15652 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 43629 event pairs, 133 based on Foata normal form. 160/6121 useless extension candidates. Maximal degree in co-relation 18969. Up to 1722 conditions per place. 
[2021-12-28 02:51:39,498 INFO  L132   encePairwiseOnDemand]: 106/116 looper letters, 78 selfloop transitions, 6 changer transitions 137/296 dead transitions.
[2021-12-28 02:51:39,498 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 2055 flow
[2021-12-28 02:51:39,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-28 02:51:39,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-28 02:51:39,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions.
[2021-12-28 02:51:39,500 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8586206896551725
[2021-12-28 02:51:39,500 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 996 transitions.
[2021-12-28 02:51:39,500 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions.
[2021-12-28 02:51:39,501 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:39,501 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions.
[2021-12-28 02:51:39,502 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:39,504 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:39,504 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:39,504 INFO  L186             Difference]: Start difference. First operand has 135 places, 116 transitions, 422 flow. Second operand 10 states and 996 transitions.
[2021-12-28 02:51:39,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 2055 flow
[2021-12-28 02:51:39,512 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 296 transitions, 2010 flow, removed 20 selfloop flow, removed 6 redundant places.
[2021-12-28 02:51:39,514 INFO  L242             Difference]: Finished difference. Result has 138 places, 118 transitions, 459 flow
[2021-12-28 02:51:39,514 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=459, PETRI_PLACES=138, PETRI_TRANSITIONS=118}
[2021-12-28 02:51:39,515 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 17 predicate places.
[2021-12-28 02:51:39,515 INFO  L470      AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 459 flow
[2021-12-28 02:51:39,515 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:39,515 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:39,515 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]
[2021-12-28 02:51:39,515 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-12-28 02:51:39,515 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:39,516 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:39,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -1201426345, now seen corresponding path program 1 times
[2021-12-28 02:51:39,516 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:39,516 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524459229]
[2021-12-28 02:51:39,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:39,516 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:39,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:39,766 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-28 02:51:39,767 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:39,767 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524459229]
[2021-12-28 02:51:39,767 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524459229] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:39,767 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:39,767 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-28 02:51:39,767 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593086085]
[2021-12-28 02:51:39,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:39,768 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-28 02:51:39,768 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:39,768 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-28 02:51:39,768 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2021-12-28 02:51:39,769 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116
[2021-12-28 02:51:39,770 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 459 flow. Second operand  has 13 states, 13 states have (on average 87.6923076923077) internal successors, (1140), 13 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:39,770 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:39,770 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116
[2021-12-28 02:51:39,770 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:40,329 INFO  L129       PetriNetUnfolder]: 535/1652 cut-off events.
[2021-12-28 02:51:40,329 INFO  L130       PetriNetUnfolder]: For 3409/3606 co-relation queries the response was YES.
[2021-12-28 02:51:40,336 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5264 conditions, 1652 events. 535/1652 cut-off events. For 3409/3606 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12398 event pairs, 206 based on Foata normal form. 7/1544 useless extension candidates. Maximal degree in co-relation 5186. Up to 584 conditions per place. 
[2021-12-28 02:51:40,342 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 47 selfloop transitions, 15 changer transitions 22/158 dead transitions.
[2021-12-28 02:51:40,342 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 158 transitions, 932 flow
[2021-12-28 02:51:40,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-28 02:51:40,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-28 02:51:40,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1269 transitions.
[2021-12-28 02:51:40,345 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7814039408866995
[2021-12-28 02:51:40,345 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1269 transitions.
[2021-12-28 02:51:40,345 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1269 transitions.
[2021-12-28 02:51:40,346 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:40,346 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1269 transitions.
[2021-12-28 02:51:40,348 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 90.64285714285714) internal successors, (1269), 14 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,350 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,350 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,350 INFO  L186             Difference]: Start difference. First operand has 138 places, 118 transitions, 459 flow. Second operand 14 states and 1269 transitions.
[2021-12-28 02:51:40,350 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 158 transitions, 932 flow
[2021-12-28 02:51:40,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 158 transitions, 918 flow, removed 3 selfloop flow, removed 5 redundant places.
[2021-12-28 02:51:40,357 INFO  L242             Difference]: Finished difference. Result has 148 places, 126 transitions, 582 flow
[2021-12-28 02:51:40,357 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=582, PETRI_PLACES=148, PETRI_TRANSITIONS=126}
[2021-12-28 02:51:40,358 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2021-12-28 02:51:40,358 INFO  L470      AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 582 flow
[2021-12-28 02:51:40,358 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.6923076923077) internal successors, (1140), 13 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,358 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:40,358 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]
[2021-12-28 02:51:40,358 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-12-28 02:51:40,359 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:40,359 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:40,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 959504979, now seen corresponding path program 1 times
[2021-12-28 02:51:40,359 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:40,359 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531088187]
[2021-12-28 02:51:40,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:40,359 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:40,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:40,444 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-28 02:51:40,444 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:40,444 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531088187]
[2021-12-28 02:51:40,444 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531088187] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:40,444 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:40,444 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-28 02:51:40,444 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51350848]
[2021-12-28 02:51:40,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:40,444 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-28 02:51:40,444 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:40,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-28 02:51:40,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-28 02:51:40,445 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2021-12-28 02:51:40,446 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 582 flow. Second operand  has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,446 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:40,446 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2021-12-28 02:51:40,446 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:40,966 INFO  L129       PetriNetUnfolder]: 1089/2551 cut-off events.
[2021-12-28 02:51:40,966 INFO  L130       PetriNetUnfolder]: For 10657/10848 co-relation queries the response was YES.
[2021-12-28 02:51:40,977 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 9566 conditions, 2551 events. 1089/2551 cut-off events. For 10657/10848 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17913 event pairs, 50 based on Foata normal form. 145/2677 useless extension candidates. Maximal degree in co-relation 9486. Up to 574 conditions per place. 
[2021-12-28 02:51:40,987 INFO  L132   encePairwiseOnDemand]: 107/116 looper letters, 88 selfloop transitions, 9 changer transitions 106/278 dead transitions.
[2021-12-28 02:51:40,988 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 278 transitions, 2318 flow
[2021-12-28 02:51:40,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-28 02:51:40,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-28 02:51:40,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions.
[2021-12-28 02:51:40,991 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.853448275862069
[2021-12-28 02:51:40,991 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 990 transitions.
[2021-12-28 02:51:40,991 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 990 transitions.
[2021-12-28 02:51:40,991 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:40,992 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 990 transitions.
[2021-12-28 02:51:40,993 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,996 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,996 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:40,996 INFO  L186             Difference]: Start difference. First operand has 148 places, 126 transitions, 582 flow. Second operand 10 states and 990 transitions.
[2021-12-28 02:51:40,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 278 transitions, 2318 flow
[2021-12-28 02:51:41,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 278 transitions, 2163 flow, removed 55 selfloop flow, removed 13 redundant places.
[2021-12-28 02:51:41,007 INFO  L242             Difference]: Finished difference. Result has 144 places, 124 transitions, 582 flow
[2021-12-28 02:51:41,008 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=582, PETRI_PLACES=144, PETRI_TRANSITIONS=124}
[2021-12-28 02:51:41,008 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places.
[2021-12-28 02:51:41,008 INFO  L470      AbstractCegarLoop]: Abstraction has has 144 places, 124 transitions, 582 flow
[2021-12-28 02:51:41,009 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,009 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:41,009 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]
[2021-12-28 02:51:41,009 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-12-28 02:51:41,009 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:41,009 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:41,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -1620102906, now seen corresponding path program 1 times
[2021-12-28 02:51:41,010 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:41,010 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063210401]
[2021-12-28 02:51:41,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:41,010 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:41,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:41,128 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-28 02:51:41,128 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:41,128 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063210401]
[2021-12-28 02:51:41,128 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063210401] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:41,128 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:41,128 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-28 02:51:41,129 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769657277]
[2021-12-28 02:51:41,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:41,129 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-28 02:51:41,129 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:41,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-28 02:51:41,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-28 02:51:41,130 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2021-12-28 02:51:41,130 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 124 transitions, 582 flow. Second operand  has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,130 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:41,131 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2021-12-28 02:51:41,131 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:41,471 INFO  L129       PetriNetUnfolder]: 379/1139 cut-off events.
[2021-12-28 02:51:41,471 INFO  L130       PetriNetUnfolder]: For 4143/4262 co-relation queries the response was YES.
[2021-12-28 02:51:41,475 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 4328 conditions, 1139 events. 379/1139 cut-off events. For 4143/4262 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7355 event pairs, 46 based on Foata normal form. 39/1159 useless extension candidates. Maximal degree in co-relation 4261. Up to 222 conditions per place. 
[2021-12-28 02:51:41,479 INFO  L132   encePairwiseOnDemand]: 107/116 looper letters, 72 selfloop transitions, 12 changer transitions 47/206 dead transitions.
[2021-12-28 02:51:41,479 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 206 transitions, 1528 flow
[2021-12-28 02:51:41,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-28 02:51:41,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-28 02:51:41,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1050 transitions.
[2021-12-28 02:51:41,482 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.822884012539185
[2021-12-28 02:51:41,482 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1050 transitions.
[2021-12-28 02:51:41,482 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1050 transitions.
[2021-12-28 02:51:41,482 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:41,482 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1050 transitions.
[2021-12-28 02:51:41,484 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 95.45454545454545) internal successors, (1050), 11 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,486 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,486 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,486 INFO  L186             Difference]: Start difference. First operand has 144 places, 124 transitions, 582 flow. Second operand 11 states and 1050 transitions.
[2021-12-28 02:51:41,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 206 transitions, 1528 flow
[2021-12-28 02:51:41,496 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 206 transitions, 1403 flow, removed 46 selfloop flow, removed 11 redundant places.
[2021-12-28 02:51:41,498 INFO  L242             Difference]: Finished difference. Result has 145 places, 124 transitions, 550 flow
[2021-12-28 02:51:41,498 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=145, PETRI_TRANSITIONS=124}
[2021-12-28 02:51:41,499 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 24 predicate places.
[2021-12-28 02:51:41,499 INFO  L470      AbstractCegarLoop]: Abstraction has has 145 places, 124 transitions, 550 flow
[2021-12-28 02:51:41,499 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,499 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:41,499 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:41,499 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-12-28 02:51:41,499 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:41,500 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:41,500 INFO  L85        PathProgramCache]: Analyzing trace with hash -548527530, now seen corresponding path program 1 times
[2021-12-28 02:51:41,500 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:41,500 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96506723]
[2021-12-28 02:51:41,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:41,500 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:41,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:41,801 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-28 02:51:41,802 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:41,802 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96506723]
[2021-12-28 02:51:41,802 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96506723] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:41,802 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:41,802 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-12-28 02:51:41,802 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246713438]
[2021-12-28 02:51:41,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:41,802 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-12-28 02:51:41,802 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:41,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-12-28 02:51:41,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2021-12-28 02:51:41,804 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116
[2021-12-28 02:51:41,805 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 124 transitions, 550 flow. Second operand  has 14 states, 14 states have (on average 87.78571428571429) internal successors, (1229), 14 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:41,805 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:41,805 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116
[2021-12-28 02:51:41,805 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:42,204 INFO  L129       PetriNetUnfolder]: 167/720 cut-off events.
[2021-12-28 02:51:42,204 INFO  L130       PetriNetUnfolder]: For 1712/1806 co-relation queries the response was YES.
[2021-12-28 02:51:42,207 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 720 events. 167/720 cut-off events. For 1712/1806 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4576 event pairs, 11 based on Foata normal form. 2/697 useless extension candidates. Maximal degree in co-relation 2232. Up to 130 conditions per place. 
[2021-12-28 02:51:42,209 INFO  L132   encePairwiseOnDemand]: 102/116 looper letters, 38 selfloop transitions, 17 changer transitions 21/153 dead transitions.
[2021-12-28 02:51:42,210 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 876 flow
[2021-12-28 02:51:42,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-28 02:51:42,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-28 02:51:42,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1266 transitions.
[2021-12-28 02:51:42,213 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7795566502463054
[2021-12-28 02:51:42,213 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1266 transitions.
[2021-12-28 02:51:42,213 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1266 transitions.
[2021-12-28 02:51:42,214 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:42,214 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1266 transitions.
[2021-12-28 02:51:42,216 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 90.42857142857143) internal successors, (1266), 14 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,218 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,218 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,218 INFO  L186             Difference]: Start difference. First operand has 145 places, 124 transitions, 550 flow. Second operand 14 states and 1266 transitions.
[2021-12-28 02:51:42,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 876 flow
[2021-12-28 02:51:42,223 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 153 transitions, 728 flow, removed 55 selfloop flow, removed 18 redundant places.
[2021-12-28 02:51:42,225 INFO  L242             Difference]: Finished difference. Result has 142 places, 121 transitions, 470 flow
[2021-12-28 02:51:42,225 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=470, PETRI_PLACES=142, PETRI_TRANSITIONS=121}
[2021-12-28 02:51:42,225 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2021-12-28 02:51:42,225 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 470 flow
[2021-12-28 02:51:42,226 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 87.78571428571429) internal successors, (1229), 14 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,226 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:42,226 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:42,226 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-12-28 02:51:42,227 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:42,227 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:42,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 2089551402, now seen corresponding path program 2 times
[2021-12-28 02:51:42,227 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:42,227 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508963371]
[2021-12-28 02:51:42,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:42,228 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:42,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:42,361 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-28 02:51:42,361 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:42,361 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508963371]
[2021-12-28 02:51:42,362 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508963371] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:42,362 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:42,362 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-28 02:51:42,362 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314551747]
[2021-12-28 02:51:42,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:42,362 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-28 02:51:42,363 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:42,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-28 02:51:42,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2021-12-28 02:51:42,363 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116
[2021-12-28 02:51:42,364 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 470 flow. Second operand  has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,364 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:42,364 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116
[2021-12-28 02:51:42,364 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:42,611 INFO  L129       PetriNetUnfolder]: 163/738 cut-off events.
[2021-12-28 02:51:42,611 INFO  L130       PetriNetUnfolder]: For 791/871 co-relation queries the response was YES.
[2021-12-28 02:51:42,614 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 738 events. 163/738 cut-off events. For 791/871 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4864 event pairs, 29 based on Foata normal form. 12/726 useless extension candidates. Maximal degree in co-relation 1882. Up to 193 conditions per place. 
[2021-12-28 02:51:42,615 INFO  L132   encePairwiseOnDemand]: 104/116 looper letters, 40 selfloop transitions, 14 changer transitions 23/156 dead transitions.
[2021-12-28 02:51:42,615 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 156 transitions, 871 flow
[2021-12-28 02:51:42,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-28 02:51:42,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-28 02:51:42,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 844 transitions.
[2021-12-28 02:51:42,617 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8084291187739464
[2021-12-28 02:51:42,617 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 844 transitions.
[2021-12-28 02:51:42,617 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 844 transitions.
[2021-12-28 02:51:42,617 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:42,617 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 844 transitions.
[2021-12-28 02:51:42,618 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,619 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,620 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,620 INFO  L186             Difference]: Start difference. First operand has 142 places, 121 transitions, 470 flow. Second operand 9 states and 844 transitions.
[2021-12-28 02:51:42,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 156 transitions, 871 flow
[2021-12-28 02:51:42,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 156 transitions, 803 flow, removed 12 selfloop flow, removed 13 redundant places.
[2021-12-28 02:51:42,624 INFO  L242             Difference]: Finished difference. Result has 139 places, 129 transitions, 572 flow
[2021-12-28 02:51:42,624 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=139, PETRI_TRANSITIONS=129}
[2021-12-28 02:51:42,624 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2021-12-28 02:51:42,624 INFO  L470      AbstractCegarLoop]: Abstraction has has 139 places, 129 transitions, 572 flow
[2021-12-28 02:51:42,625 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,625 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:42,625 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:42,625 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-12-28 02:51:42,625 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:42,625 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:42,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 1048085846, now seen corresponding path program 3 times
[2021-12-28 02:51:42,625 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:42,626 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265029508]
[2021-12-28 02:51:42,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:42,626 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:42,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:42,884 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-28 02:51:42,884 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:42,884 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265029508]
[2021-12-28 02:51:42,884 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265029508] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:42,884 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:42,884 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-28 02:51:42,885 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240346566]
[2021-12-28 02:51:42,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:42,885 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-28 02:51:42,885 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:42,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-28 02:51:42,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2021-12-28 02:51:42,886 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116
[2021-12-28 02:51:42,887 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 129 transitions, 572 flow. Second operand  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:42,887 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:42,887 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116
[2021-12-28 02:51:42,888 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:43,276 INFO  L129       PetriNetUnfolder]: 157/773 cut-off events.
[2021-12-28 02:51:43,276 INFO  L130       PetriNetUnfolder]: For 976/1015 co-relation queries the response was YES.
[2021-12-28 02:51:43,279 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 773 events. 157/773 cut-off events. For 976/1015 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5205 event pairs, 20 based on Foata normal form. 9/757 useless extension candidates. Maximal degree in co-relation 2020. Up to 97 conditions per place. 
[2021-12-28 02:51:43,281 INFO  L132   encePairwiseOnDemand]: 105/116 looper letters, 50 selfloop transitions, 9 changer transitions 26/161 dead transitions.
[2021-12-28 02:51:43,281 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 943 flow
[2021-12-28 02:51:43,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-28 02:51:43,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-28 02:51:43,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 994 transitions.
[2021-12-28 02:51:43,283 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7789968652037618
[2021-12-28 02:51:43,283 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 994 transitions.
[2021-12-28 02:51:43,283 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 994 transitions.
[2021-12-28 02:51:43,284 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:43,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 994 transitions.
[2021-12-28 02:51:43,285 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,286 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,287 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,287 INFO  L186             Difference]: Start difference. First operand has 139 places, 129 transitions, 572 flow. Second operand 11 states and 994 transitions.
[2021-12-28 02:51:43,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 943 flow
[2021-12-28 02:51:43,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 908 flow, removed 12 selfloop flow, removed 5 redundant places.
[2021-12-28 02:51:43,297 INFO  L242             Difference]: Finished difference. Result has 144 places, 117 transitions, 477 flow
[2021-12-28 02:51:43,298 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=477, PETRI_PLACES=144, PETRI_TRANSITIONS=117}
[2021-12-28 02:51:43,298 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places.
[2021-12-28 02:51:43,298 INFO  L470      AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 477 flow
[2021-12-28 02:51:43,303 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,304 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:43,304 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:43,304 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-12-28 02:51:43,304 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:43,304 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:43,305 INFO  L85        PathProgramCache]: Analyzing trace with hash -1206438814, now seen corresponding path program 4 times
[2021-12-28 02:51:43,305 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:43,305 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451412762]
[2021-12-28 02:51:43,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:43,305 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:43,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:43,451 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-28 02:51:43,452 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:43,452 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451412762]
[2021-12-28 02:51:43,452 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451412762] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:43,452 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:43,452 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-28 02:51:43,452 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38452602]
[2021-12-28 02:51:43,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:43,453 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-28 02:51:43,453 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:43,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-28 02:51:43,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-12-28 02:51:43,454 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116
[2021-12-28 02:51:43,455 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 477 flow. Second operand  has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,455 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:43,455 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116
[2021-12-28 02:51:43,455 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:43,768 INFO  L129       PetriNetUnfolder]: 110/643 cut-off events.
[2021-12-28 02:51:43,768 INFO  L130       PetriNetUnfolder]: For 628/665 co-relation queries the response was YES.
[2021-12-28 02:51:43,771 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 643 events. 110/643 cut-off events. For 628/665 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4208 event pairs, 12 based on Foata normal form. 13/644 useless extension candidates. Maximal degree in co-relation 1500. Up to 78 conditions per place. 
[2021-12-28 02:51:43,774 INFO  L132   encePairwiseOnDemand]: 106/116 looper letters, 47 selfloop transitions, 11 changer transitions 14/150 dead transitions.
[2021-12-28 02:51:43,774 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 150 transitions, 833 flow
[2021-12-28 02:51:43,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-28 02:51:43,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-28 02:51:43,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions.
[2021-12-28 02:51:43,776 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7938871473354232
[2021-12-28 02:51:43,776 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1013 transitions.
[2021-12-28 02:51:43,776 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1013 transitions.
[2021-12-28 02:51:43,776 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:43,776 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1013 transitions.
[2021-12-28 02:51:43,777 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 92.0909090909091) internal successors, (1013), 11 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,778 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,779 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,779 INFO  L186             Difference]: Start difference. First operand has 144 places, 117 transitions, 477 flow. Second operand 11 states and 1013 transitions.
[2021-12-28 02:51:43,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 150 transitions, 833 flow
[2021-12-28 02:51:43,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 150 transitions, 738 flow, removed 25 selfloop flow, removed 13 redundant places.
[2021-12-28 02:51:43,783 INFO  L242             Difference]: Finished difference. Result has 142 places, 120 transitions, 494 flow
[2021-12-28 02:51:43,783 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=494, PETRI_PLACES=142, PETRI_TRANSITIONS=120}
[2021-12-28 02:51:43,784 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2021-12-28 02:51:43,784 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 120 transitions, 494 flow
[2021-12-28 02:51:43,784 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:43,784 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:43,784 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:43,784 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-12-28 02:51:43,785 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:43,785 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:43,785 INFO  L85        PathProgramCache]: Analyzing trace with hash -892590182, now seen corresponding path program 5 times
[2021-12-28 02:51:43,785 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:43,785 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203621667]
[2021-12-28 02:51:43,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:43,785 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:43,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:44,073 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-28 02:51:44,073 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:44,073 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203621667]
[2021-12-28 02:51:44,074 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203621667] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:44,074 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:44,074 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-12-28 02:51:44,074 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995742695]
[2021-12-28 02:51:44,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:44,074 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-12-28 02:51:44,074 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:44,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-12-28 02:51:44,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2021-12-28 02:51:44,075 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 116
[2021-12-28 02:51:44,076 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 120 transitions, 494 flow. Second operand  has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:44,076 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:44,076 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 116
[2021-12-28 02:51:44,076 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:44,517 INFO  L129       PetriNetUnfolder]: 123/725 cut-off events.
[2021-12-28 02:51:44,517 INFO  L130       PetriNetUnfolder]: For 597/620 co-relation queries the response was YES.
[2021-12-28 02:51:44,520 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 725 events. 123/725 cut-off events. For 597/620 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5180 event pairs, 6 based on Foata normal form. 7/718 useless extension candidates. Maximal degree in co-relation 1618. Up to 92 conditions per place. 
[2021-12-28 02:51:44,522 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 41 selfloop transitions, 21 changer transitions 10/146 dead transitions.
[2021-12-28 02:51:44,522 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 811 flow
[2021-12-28 02:51:44,523 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-28 02:51:44,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-28 02:51:44,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1219 transitions.
[2021-12-28 02:51:44,524 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.750615763546798
[2021-12-28 02:51:44,524 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1219 transitions.
[2021-12-28 02:51:44,524 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1219 transitions.
[2021-12-28 02:51:44,525 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:44,525 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1219 transitions.
[2021-12-28 02:51:44,526 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 87.07142857142857) internal successors, (1219), 14 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:44,528 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:44,528 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:44,529 INFO  L186             Difference]: Start difference. First operand has 142 places, 120 transitions, 494 flow. Second operand 14 states and 1219 transitions.
[2021-12-28 02:51:44,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 811 flow
[2021-12-28 02:51:44,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 146 transitions, 772 flow, removed 16 selfloop flow, removed 7 redundant places.
[2021-12-28 02:51:44,534 INFO  L242             Difference]: Finished difference. Result has 149 places, 127 transitions, 601 flow
[2021-12-28 02:51:44,534 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=601, PETRI_PLACES=149, PETRI_TRANSITIONS=127}
[2021-12-28 02:51:44,535 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 28 predicate places.
[2021-12-28 02:51:44,535 INFO  L470      AbstractCegarLoop]: Abstraction has has 149 places, 127 transitions, 601 flow
[2021-12-28 02:51:44,535 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:44,535 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:44,535 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:44,536 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-12-28 02:51:44,536 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:44,536 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:44,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 1811293316, now seen corresponding path program 6 times
[2021-12-28 02:51:44,536 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:44,536 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971202136]
[2021-12-28 02:51:44,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:44,536 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:44,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-28 02:51:44,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-28 02:51:44,751 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-28 02:51:44,751 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971202136]
[2021-12-28 02:51:44,751 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971202136] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-28 02:51:44,751 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-28 02:51:44,752 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-28 02:51:44,752 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707937464]
[2021-12-28 02:51:44,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-28 02:51:44,752 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-28 02:51:44,752 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-28 02:51:44,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-28 02:51:44,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2021-12-28 02:51:44,753 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116
[2021-12-28 02:51:44,754 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 127 transitions, 601 flow. Second operand  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:44,754 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-28 02:51:44,754 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116
[2021-12-28 02:51:44,754 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-28 02:51:45,083 INFO  L129       PetriNetUnfolder]: 160/981 cut-off events.
[2021-12-28 02:51:45,083 INFO  L130       PetriNetUnfolder]: For 941/964 co-relation queries the response was YES.
[2021-12-28 02:51:45,087 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 981 events. 160/981 cut-off events. For 941/964 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8098 event pairs, 15 based on Foata normal form. 7/967 useless extension candidates. Maximal degree in co-relation 2133. Up to 138 conditions per place. 
[2021-12-28 02:51:45,088 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 31 selfloop transitions, 12 changer transitions 28/147 dead transitions.
[2021-12-28 02:51:45,089 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 147 transitions, 874 flow
[2021-12-28 02:51:45,089 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-28 02:51:45,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-28 02:51:45,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1156 transitions.
[2021-12-28 02:51:45,090 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.76657824933687
[2021-12-28 02:51:45,090 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1156 transitions.
[2021-12-28 02:51:45,090 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1156 transitions.
[2021-12-28 02:51:45,091 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-28 02:51:45,091 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1156 transitions.
[2021-12-28 02:51:45,092 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-28 02:51:45,093 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:45,094 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:45,094 INFO  L186             Difference]: Start difference. First operand has 149 places, 127 transitions, 601 flow. Second operand 13 states and 1156 transitions.
[2021-12-28 02:51:45,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 147 transitions, 874 flow
[2021-12-28 02:51:45,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 830 flow, removed 17 selfloop flow, removed 8 redundant places.
[2021-12-28 02:51:45,099 INFO  L242             Difference]: Finished difference. Result has 154 places, 117 transitions, 476 flow
[2021-12-28 02:51:45,099 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=476, PETRI_PLACES=154, PETRI_TRANSITIONS=117}
[2021-12-28 02:51:45,100 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 33 predicate places.
[2021-12-28 02:51:45,100 INFO  L470      AbstractCegarLoop]: Abstraction has has 154 places, 117 transitions, 476 flow
[2021-12-28 02:51:45,100 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-28 02:51:45,100 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-28 02:51:45,101 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:45,101 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-12-28 02:51:45,101 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-28 02:51:45,101 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-28 02:51:45,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 1921726560, now seen corresponding path program 7 times
[2021-12-28 02:51:45,101 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-28 02:51:45,101 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114999759]
[2021-12-28 02:51:45,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-28 02:51:45,102 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-28 02:51:45,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-28 02:51:45,168 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-28 02:51:45,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-28 02:51:45,259 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-28 02:51:45,260 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2021-12-28 02:51:45,260 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2021-12-28 02:51:45,262 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2021-12-28 02:51:45,264 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2021-12-28 02:51:45,264 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2021-12-28 02:51:45,265 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2021-12-28 02:51:45,265 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2021-12-28 02:51:45,265 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-12-28 02:51:45,267 INFO  L732         BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-28 02:51:45,271 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-12-28 02:51:45,271 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-12-28 02:51:45,381 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:51:45 BasicIcfg
[2021-12-28 02:51:45,381 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-12-28 02:51:45,382 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-12-28 02:51:45,382 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-12-28 02:51:45,382 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-12-28 02:51:45,382 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:51:34" (3/4) ...
[2021-12-28 02:51:45,383 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-12-28 02:51:45,497 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-12-28 02:51:45,497 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-12-28 02:51:45,498 INFO  L158              Benchmark]: Toolchain (without parser) took 13162.49ms. Allocated memory was 52.4MB in the beginning and 648.0MB in the end (delta: 595.6MB). Free memory was 28.0MB in the beginning and 438.9MB in the end (delta: -410.9MB). Peak memory consumption was 185.5MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,498 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2021-12-28 02:51:45,499 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 438.32ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.8MB in the beginning and 37.2MB in the end (delta: -9.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,499 INFO  L158              Benchmark]: Boogie Procedure Inliner took 59.40ms. Allocated memory is still 69.2MB. Free memory was 37.2MB in the beginning and 34.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,499 INFO  L158              Benchmark]: Boogie Preprocessor took 57.77ms. Allocated memory is still 69.2MB. Free memory was 34.2MB in the beginning and 48.4MB in the end (delta: -14.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,500 INFO  L158              Benchmark]: RCFGBuilder took 1137.92ms. Allocated memory was 69.2MB in the beginning and 115.3MB in the end (delta: 46.1MB). Free memory was 48.4MB in the beginning and 73.7MB in the end (delta: -25.3MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,500 INFO  L158              Benchmark]: TraceAbstraction took 11346.93ms. Allocated memory was 115.3MB in the beginning and 648.0MB in the end (delta: 532.7MB). Free memory was 73.2MB in the beginning and 482.9MB in the end (delta: -409.8MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,500 INFO  L158              Benchmark]: Witness Printer took 115.65ms. Allocated memory is still 648.0MB. Free memory was 482.9MB in the beginning and 438.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB.
[2021-12-28 02:51:45,502 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.17ms. Allocated memory is still 52.4MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 438.32ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.8MB in the beginning and 37.2MB in the end (delta: -9.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 59.40ms. Allocated memory is still 69.2MB. Free memory was 37.2MB in the beginning and 34.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 57.77ms. Allocated memory is still 69.2MB. Free memory was 34.2MB in the beginning and 48.4MB in the end (delta: -14.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1137.92ms. Allocated memory was 69.2MB in the beginning and 115.3MB in the end (delta: 46.1MB). Free memory was 48.4MB in the beginning and 73.7MB in the end (delta: -25.3MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11346.93ms. Allocated memory was 115.3MB in the beginning and 648.0MB in the end (delta: 532.7MB). Free memory was 73.2MB in the beginning and 482.9MB in the end (delta: -409.8MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB.
 * Witness Printer took 115.65ms. Allocated memory is still 648.0MB. Free memory was 482.9MB in the beginning and 438.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. 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_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0]
[L716]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L717]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L718]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L720]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L722]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L723]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L724]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L725]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L726]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L727]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L728]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L729]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L730]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L731]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L732]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L733]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L734]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L735]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L736]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L737]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L738]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L739]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L740]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L854]               0  pthread_t t2321;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L855]  FCALL, FORK  0  pthread_create(&t2321, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L856]               0  pthread_t t2322;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L857]  FCALL, FORK  0  pthread_create(&t2322, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L784]               2  y$w_buff1 = y$w_buff0
[L785]               2  y$w_buff0 = 2
[L786]               2  y$w_buff1_used = y$w_buff0_used
[L787]               2  y$w_buff0_used = (_Bool)1
[L788]  CALL         2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L788]  RET          2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L789]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L790]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L791]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L792]               2  y$r_buff1_thd3 = y$r_buff0_thd3
[L793]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L796]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L858]               0  pthread_t t2323;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L859]  FCALL, FORK  0  pthread_create(&t2323, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L813]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L816]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L817]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L818]               3  y$flush_delayed = weak$$choice2
[L819]               3  y$mem_tmp = y
[L820]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L820]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827]               3  __unbuffered_p2_EBX = y
[L828]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L828]               3  y = y$flush_delayed ? y$mem_tmp : y
[L829]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L744]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L748]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L748]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L749]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L749]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L750]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L751]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EAX = y
[L766]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L771]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L771]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L772]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L772]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L773]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L773]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L774]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L774]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L799]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L799]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L800]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L800]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L801]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L802]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L802]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L803]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L803]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L833]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L834]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L835]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L836]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L836]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L806]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L777]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L861]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L863]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L863]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L867]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L868]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L869]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L869]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L872]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L873]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L874]               0  y$flush_delayed = weak$$choice2
[L875]               0  y$mem_tmp = y
[L876]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L876]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L883]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L884]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L884]               0  y = y$flush_delayed ? y$mem_tmp : y
[L885]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L887]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L19]                0  reach_error()
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 788 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 788 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1665 mSDsCounter, 413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3145 IncrementalHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 413 mSolverCounterUnsat, 155 mSDtfsCounter, 3145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=601occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1421 NumberOfCodeBlocks, 1421 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1315 ConstructedInterpolants, 0 QuantifiedInterpolants, 7294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2021-12-28 02:51:45,544 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