/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 18:26:22,115 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 18:26:22,118 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 18:26:22,157 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 18:26:22,157 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 18:26:22,165 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 18:26:22,168 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 18:26:22,172 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 18:26:22,175 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 18:26:22,178 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 18:26:22,179 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 18:26:22,180 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 18:26:22,180 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 18:26:22,183 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 18:26:22,188 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 18:26:22,189 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 18:26:22,190 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 18:26:22,191 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 18:26:22,193 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 18:26:22,194 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 18:26:22,196 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 18:26:22,197 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 18:26:22,198 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 18:26:22,199 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 18:26:22,201 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 18:26:22,201 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 18:26:22,201 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 18:26:22,202 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 18:26:22,203 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 18:26:22,204 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 18:26:22,204 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 18:26:22,205 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 18:26:22,205 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 18:26:22,206 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 18:26:22,207 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 18:26:22,207 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 18:26:22,208 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 18:26:22,208 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 18:26:22,209 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 18:26:22,209 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 18:26:22,210 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 18:26:22,211 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf
[2020-10-11 18:26:22,232 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 18:26:22,232 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 18:26:22,234 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 18:26:22,234 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 18:26:22,234 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 18:26:22,234 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 18:26:22,235 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 18:26:22,235 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 18:26:22,235 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 18:26:22,235 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 18:26:22,235 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 18:26:22,235 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 18:26:22,236 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 18:26:22,236 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 18:26:22,236 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 18:26:22,236 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 18:26:22,236 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 18:26:22,237 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 18:26:22,237 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 18:26:22,237 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 18:26:22,237 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 18:26:22,237 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 18:26:22,238 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 18:26:22,238 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 18:26:22,238 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 18:26:22,238 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 18:26:22,238 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 18:26:22,239 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2020-10-11 18:26:22,239 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-11 18:26:22,239 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 18:26:22,562 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 18:26:22,575 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 18:26:22,578 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 18:26:22,580 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 18:26:22,580 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 18:26:22,581 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i
[2020-10-11 18:26:22,645 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76f5a27e/a666bc29564542f597fc671c0ceb26b5/FLAG9c9cc0d6e
[2020-10-11 18:26:23,244 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 18:26:23,244 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i
[2020-10-11 18:26:23,262 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76f5a27e/a666bc29564542f597fc671c0ceb26b5/FLAG9c9cc0d6e
[2020-10-11 18:26:23,472 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76f5a27e/a666bc29564542f597fc671c0ceb26b5
[2020-10-11 18:26:23,481 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 18:26:23,483 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 18:26:23,484 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 18:26:23,484 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 18:26:23,488 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 18:26:23,489 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:23" (1/1) ...
[2020-10-11 18:26:23,492 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6983a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:23, skipping insertion in model container
[2020-10-11 18:26:23,492 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:23" (1/1) ...
[2020-10-11 18:26:23,500 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 18:26:23,542 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 18:26:24,097 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 18:26:24,109 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 18:26:24,179 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 18:26:24,252 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 18:26:24,252 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24 WrapperNode
[2020-10-11 18:26:24,252 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 18:26:24,253 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 18:26:24,253 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 18:26:24,254 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 18:26:24,263 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,282 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,321 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 18:26:24,321 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 18:26:24,321 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 18:26:24,321 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 18:26:24,330 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,331 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,336 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,336 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,346 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,351 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,354 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
[2020-10-11 18:26:24,360 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 18:26:24,361 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 18:26:24,361 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 18:26:24,361 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 18:26:24,362 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 18:26:24,433 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 18:26:24,434 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 18:26:24,434 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 18:26:24,434 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 18:26:24,434 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 18:26:24,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 18:26:24,435 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 18:26:24,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 18:26:24,435 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 18:26:24,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 18:26:24,435 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 18:26:24,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 18:26:24,436 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 18:26:24,436 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 18:26:24,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 18:26:24,438 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 18:26:26,345 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 18:26:26,346 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 18:26:26,348 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:26 BoogieIcfgContainer
[2020-10-11 18:26:26,348 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 18:26:26,350 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 18:26:26,350 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 18:26:26,353 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 18:26:26,353 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:26:23" (1/3) ...
[2020-10-11 18:26:26,354 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c7ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:26, skipping insertion in model container
[2020-10-11 18:26:26,354 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:24" (2/3) ...
[2020-10-11 18:26:26,355 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c7ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:26, skipping insertion in model container
[2020-10-11 18:26:26,355 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:26" (3/3) ...
[2020-10-11 18:26:26,357 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i
[2020-10-11 18:26:26,368 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 18:26:26,376 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 18:26:26,377 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 18:26:26,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,408 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,409 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,410 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,410 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,410 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,410 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,411 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,411 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,411 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,412 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,412 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,412 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,412 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,412 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,413 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,413 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,413 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,413 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,414 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,414 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,414 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,415 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,415 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,415 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,415 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,415 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,416 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,416 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,417 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,417 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,417 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,417 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,418 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,418 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,422 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,422 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,422 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,423 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,423 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,423 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,423 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,423 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,424 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,424 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,428 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,428 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,428 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,429 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,430 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,430 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,430 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,430 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,434 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,435 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,437 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,437 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,437 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:26,454 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 18:26:26,477 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 18:26:26,477 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-11 18:26:26,477 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 18:26:26,478 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 18:26:26,478 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 18:26:26,478 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 18:26:26,478 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 18:26:26,478 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 18:26:26,493 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow
[2020-10-11 18:26:26,545 INFO  L129       PetriNetUnfolder]: 2/103 cut-off events.
[2020-10-11 18:26:26,545 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:26,551 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2020-10-11 18:26:26,551 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow
[2020-10-11 18:26:26,558 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow
[2020-10-11 18:26:26,579 INFO  L129       PetriNetUnfolder]: 0/70 cut-off events.
[2020-10-11 18:26:26,579 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:26,579 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:26,581 INFO  L255   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]
[2020-10-11 18:26:26,581 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:26,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:26,589 INFO  L82        PathProgramCache]: Analyzing trace with hash 1614687930, now seen corresponding path program 1 times
[2020-10-11 18:26:26,602 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:26,603 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116456115]
[2020-10-11 18:26:26,604 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:26,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:26,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:26,960 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116456115]
[2020-10-11 18:26:26,961 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:26,961 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 18:26:26,962 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869485607]
[2020-10-11 18:26:26,973 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 18:26:26,973 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:26,988 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 18:26:26,991 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 18:26:27,110 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 107
[2020-10-11 18:26:27,113 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states.
[2020-10-11 18:26:27,113 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:27,113 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 107
[2020-10-11 18:26:27,115 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:27,149 INFO  L129       PetriNetUnfolder]: 0/100 cut-off events.
[2020-10-11 18:26:27,149 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:27,150 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 116 conditions, 100 events. 0/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. 
[2020-10-11 18:26:27,151 INFO  L132   encePairwiseOnDemand]: 102/107 looper letters, 0 selfloop transitions, 2 changer transitions 13/100 dead transitions.
[2020-10-11 18:26:27,151 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 100 transitions, 216 flow
[2020-10-11 18:26:27,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 18:26:27,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-11 18:26:27,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions.
[2020-10-11 18:26:27,169 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9750778816199377
[2020-10-11 18:26:27,170 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 313 transitions.
[2020-10-11 18:26:27,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions.
[2020-10-11 18:26:27,172 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:27,175 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions.
[2020-10-11 18:26:27,179 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-11 18:26:27,185 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-11 18:26:27,186 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-11 18:26:27,188 INFO  L185             Difference]: Start difference. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states and 313 transitions.
[2020-10-11 18:26:27,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 100 transitions, 216 flow
[2020-10-11 18:26:27,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:27,197 INFO  L241             Difference]: Finished difference. Result has 111 places, 87 transitions, 186 flow
[2020-10-11 18:26:27,200 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=87}
[2020-10-11 18:26:27,202 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places.
[2020-10-11 18:26:27,202 INFO  L481      AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 186 flow
[2020-10-11 18:26:27,202 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 18:26:27,202 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:27,202 INFO  L255   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]
[2020-10-11 18:26:27,203 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 18:26:27,203 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:27,203 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:27,203 INFO  L82        PathProgramCache]: Analyzing trace with hash 343442451, now seen corresponding path program 1 times
[2020-10-11 18:26:27,204 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:27,204 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767028192]
[2020-10-11 18:26:27,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:27,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:27,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:27,487 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767028192]
[2020-10-11 18:26:27,487 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:27,488 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:27,488 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865179000]
[2020-10-11 18:26:27,490 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:27,491 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:27,491 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:27,492 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:27,636 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:27,637 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 87 transitions, 186 flow. Second operand 6 states.
[2020-10-11 18:26:27,637 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:27,637 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:27,638 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:27,803 INFO  L129       PetriNetUnfolder]: 24/163 cut-off events.
[2020-10-11 18:26:27,803 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:27,805 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 236 conditions, 163 events. 24/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 450 event pairs, 5 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 196. Up to 31 conditions per place. 
[2020-10-11 18:26:27,806 INFO  L132   encePairwiseOnDemand]: 100/107 looper letters, 8 selfloop transitions, 3 changer transitions 19/108 dead transitions.
[2020-10-11 18:26:27,806 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 288 flow
[2020-10-11 18:26:27,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:27,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:27,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions.
[2020-10-11 18:26:27,812 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9304257528556594
[2020-10-11 18:26:27,812 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 896 transitions.
[2020-10-11 18:26:27,813 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions.
[2020-10-11 18:26:27,813 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:27,814 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions.
[2020-10-11 18:26:27,816 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:27,820 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:27,820 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:27,820 INFO  L185             Difference]: Start difference. First operand has 111 places, 87 transitions, 186 flow. Second operand 9 states and 896 transitions.
[2020-10-11 18:26:27,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 288 flow
[2020-10-11 18:26:27,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-11 18:26:27,826 INFO  L241             Difference]: Finished difference. Result has 111 places, 89 transitions, 225 flow
[2020-10-11 18:26:27,826 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=111, PETRI_TRANSITIONS=89}
[2020-10-11 18:26:27,827 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places.
[2020-10-11 18:26:27,827 INFO  L481      AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 225 flow
[2020-10-11 18:26:27,827 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:27,827 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:27,828 INFO  L255   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]
[2020-10-11 18:26:27,828 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 18:26:27,828 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:27,828 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:27,828 INFO  L82        PathProgramCache]: Analyzing trace with hash -655605036, now seen corresponding path program 1 times
[2020-10-11 18:26:27,829 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:27,829 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591977792]
[2020-10-11 18:26:27,829 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:27,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:28,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:28,101 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591977792]
[2020-10-11 18:26:28,101 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:28,102 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:28,102 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608943079]
[2020-10-11 18:26:28,102 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:28,103 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:28,103 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:28,103 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:28,785 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:28,785 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 225 flow. Second operand 10 states.
[2020-10-11 18:26:28,785 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:28,786 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:28,786 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:29,330 INFO  L129       PetriNetUnfolder]: 292/669 cut-off events.
[2020-10-11 18:26:29,331 INFO  L130       PetriNetUnfolder]: For 595/597 co-relation queries the response was YES.
[2020-10-11 18:26:29,340 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 669 events. 292/669 cut-off events. For 595/597 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3701 event pairs, 107 based on Foata normal form. 21/663 useless extension candidates. Maximal degree in co-relation 1562. Up to 258 conditions per place. 
[2020-10-11 18:26:29,346 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 12 selfloop transitions, 10 changer transitions 34/130 dead transitions.
[2020-10-11 18:26:29,346 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 130 transitions, 447 flow
[2020-10-11 18:26:29,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:29,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:29,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1394 transitions.
[2020-10-11 18:26:29,352 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8685358255451714
[2020-10-11 18:26:29,353 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1394 transitions.
[2020-10-11 18:26:29,353 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1394 transitions.
[2020-10-11 18:26:29,354 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:29,354 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1394 transitions.
[2020-10-11 18:26:29,356 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:29,360 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:29,360 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:29,360 INFO  L185             Difference]: Start difference. First operand has 111 places, 89 transitions, 225 flow. Second operand 15 states and 1394 transitions.
[2020-10-11 18:26:29,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 130 transitions, 447 flow
[2020-10-11 18:26:29,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 130 transitions, 426 flow, removed 9 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:29,373 INFO  L241             Difference]: Finished difference. Result has 126 places, 95 transitions, 302 flow
[2020-10-11 18:26:29,373 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=302, PETRI_PLACES=126, PETRI_TRANSITIONS=95}
[2020-10-11 18:26:29,377 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 12 predicate places.
[2020-10-11 18:26:29,377 INFO  L481      AbstractCegarLoop]: Abstraction has has 126 places, 95 transitions, 302 flow
[2020-10-11 18:26:29,377 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:29,377 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:29,384 INFO  L255   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]
[2020-10-11 18:26:29,384 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 18:26:29,384 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:29,385 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:29,385 INFO  L82        PathProgramCache]: Analyzing trace with hash -44956850, now seen corresponding path program 1 times
[2020-10-11 18:26:29,387 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:29,388 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246518928]
[2020-10-11 18:26:29,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:29,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:29,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:29,629 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246518928]
[2020-10-11 18:26:29,629 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:29,629 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:29,630 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636299853]
[2020-10-11 18:26:29,630 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:29,630 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:29,631 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:29,631 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:29,769 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:29,769 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 95 transitions, 302 flow. Second operand 6 states.
[2020-10-11 18:26:29,770 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:29,770 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:29,770 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:30,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L7-->L7-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|)  InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][112], [70#L796true, 8#L7-1true, 202#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 132#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 0)), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 127#(= ~y~0 0), 149#true, 93#L739true, 34#L754true, 99#L769true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0)), Black: 162#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork0InUse, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), P1Thread1of1ForFork3InUse, Black: 152#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P3Thread1of1ForFork1InUse, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= ~z$w_buff0_used~0 0) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 154#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork2InUse, Black: 172#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 174#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0)))])
[2020-10-11 18:26:30,068 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:30,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:30,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:30,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:30,080 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L7-->L7-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|)  InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][112], [5#L806true, 8#L7-1true, 202#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 132#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 0)), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 127#(= ~y~0 0), 149#true, 93#L739true, 34#L754true, 99#L769true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0)), Black: 162#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= ~z$w_buff0_used~0 0)), P2Thread1of1ForFork0InUse, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), P1Thread1of1ForFork3InUse, Black: 152#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P3Thread1of1ForFork1InUse, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= ~z$w_buff0_used~0 0) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), Black: 154#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), P0Thread1of1ForFork2InUse, Black: 156#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 174#(and (<= 1 ~main$tmp_guard1~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0)))])
[2020-10-11 18:26:30,080 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:30,080 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:30,080 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:30,080 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:30,082 INFO  L129       PetriNetUnfolder]: 358/921 cut-off events.
[2020-10-11 18:26:30,082 INFO  L130       PetriNetUnfolder]: For 2798/2896 co-relation queries the response was YES.
[2020-10-11 18:26:30,092 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 921 events. 358/921 cut-off events. For 2798/2896 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6286 event pairs, 122 based on Foata normal form. 30/886 useless extension candidates. Maximal degree in co-relation 2915. Up to 242 conditions per place. 
[2020-10-11 18:26:30,100 INFO  L132   encePairwiseOnDemand]: 100/107 looper letters, 17 selfloop transitions, 15 changer transitions 0/117 dead transitions.
[2020-10-11 18:26:30,100 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 453 flow
[2020-10-11 18:26:30,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:30,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:30,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions.
[2020-10-11 18:26:30,103 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9304257528556594
[2020-10-11 18:26:30,103 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 896 transitions.
[2020-10-11 18:26:30,104 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions.
[2020-10-11 18:26:30,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:30,105 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions.
[2020-10-11 18:26:30,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:30,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:30,108 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:30,108 INFO  L185             Difference]: Start difference. First operand has 126 places, 95 transitions, 302 flow. Second operand 9 states and 896 transitions.
[2020-10-11 18:26:30,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 453 flow
[2020-10-11 18:26:30,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 435 flow, removed 7 selfloop flow, removed 5 redundant places.
[2020-10-11 18:26:30,118 INFO  L241             Difference]: Finished difference. Result has 125 places, 109 transitions, 433 flow
[2020-10-11 18:26:30,118 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=433, PETRI_PLACES=125, PETRI_TRANSITIONS=109}
[2020-10-11 18:26:30,118 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places.
[2020-10-11 18:26:30,119 INFO  L481      AbstractCegarLoop]: Abstraction has has 125 places, 109 transitions, 433 flow
[2020-10-11 18:26:30,119 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:30,119 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:30,119 INFO  L255   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]
[2020-10-11 18:26:30,119 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 18:26:30,119 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:30,120 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:30,120 INFO  L82        PathProgramCache]: Analyzing trace with hash -2107477394, now seen corresponding path program 1 times
[2020-10-11 18:26:30,120 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:30,120 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459265240]
[2020-10-11 18:26:30,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:30,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:30,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:30,280 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459265240]
[2020-10-11 18:26:30,280 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:30,280 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:30,281 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238142757]
[2020-10-11 18:26:30,282 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:30,283 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:30,283 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:30,283 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:30,448 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:30,449 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 109 transitions, 433 flow. Second operand 6 states.
[2020-10-11 18:26:30,449 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:30,450 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:30,450 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:30,813 INFO  L129       PetriNetUnfolder]: 286/1082 cut-off events.
[2020-10-11 18:26:30,813 INFO  L130       PetriNetUnfolder]: For 3953/4388 co-relation queries the response was YES.
[2020-10-11 18:26:30,824 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 1082 events. 286/1082 cut-off events. For 3953/4388 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9078 event pairs, 85 based on Foata normal form. 27/1040 useless extension candidates. Maximal degree in co-relation 3672. Up to 182 conditions per place. 
[2020-10-11 18:26:30,832 INFO  L132   encePairwiseOnDemand]: 101/107 looper letters, 22 selfloop transitions, 7 changer transitions 6/126 dead transitions.
[2020-10-11 18:26:30,832 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 126 transitions, 651 flow
[2020-10-11 18:26:30,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:30,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:30,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions.
[2020-10-11 18:26:30,835 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9241952232606438
[2020-10-11 18:26:30,836 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 890 transitions.
[2020-10-11 18:26:30,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions.
[2020-10-11 18:26:30,836 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:30,837 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions.
[2020-10-11 18:26:30,838 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:30,840 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:30,840 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:30,840 INFO  L185             Difference]: Start difference. First operand has 125 places, 109 transitions, 433 flow. Second operand 9 states and 890 transitions.
[2020-10-11 18:26:30,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 126 transitions, 651 flow
[2020-10-11 18:26:30,847 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 126 transitions, 639 flow, removed 6 selfloop flow, removed 0 redundant places.
[2020-10-11 18:26:30,850 INFO  L241             Difference]: Finished difference. Result has 140 places, 113 transitions, 507 flow
[2020-10-11 18:26:30,850 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=507, PETRI_PLACES=140, PETRI_TRANSITIONS=113}
[2020-10-11 18:26:30,851 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places.
[2020-10-11 18:26:30,851 INFO  L481      AbstractCegarLoop]: Abstraction has has 140 places, 113 transitions, 507 flow
[2020-10-11 18:26:30,851 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:30,851 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:30,851 INFO  L255   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]
[2020-10-11 18:26:30,852 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 18:26:30,852 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:30,852 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:30,852 INFO  L82        PathProgramCache]: Analyzing trace with hash -1906446191, now seen corresponding path program 1 times
[2020-10-11 18:26:30,852 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:30,853 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210863026]
[2020-10-11 18:26:30,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:30,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:31,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:31,055 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210863026]
[2020-10-11 18:26:31,055 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:31,055 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-11 18:26:31,055 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105823598]
[2020-10-11 18:26:31,056 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 18:26:31,056 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:31,056 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 18:26:31,056 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-10-11 18:26:31,522 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107
[2020-10-11 18:26:31,522 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 113 transitions, 507 flow. Second operand 8 states.
[2020-10-11 18:26:31,523 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:31,523 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107
[2020-10-11 18:26:31,523 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:32,485 INFO  L129       PetriNetUnfolder]: 1119/2490 cut-off events.
[2020-10-11 18:26:32,485 INFO  L130       PetriNetUnfolder]: For 14954/15285 co-relation queries the response was YES.
[2020-10-11 18:26:32,518 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 10432 conditions, 2490 events. 1119/2490 cut-off events. For 14954/15285 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 20190 event pairs, 268 based on Foata normal form. 41/2419 useless extension candidates. Maximal degree in co-relation 10357. Up to 902 conditions per place. 
[2020-10-11 18:26:32,533 INFO  L132   encePairwiseOnDemand]: 98/107 looper letters, 22 selfloop transitions, 7 changer transitions 69/176 dead transitions.
[2020-10-11 18:26:32,534 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 176 transitions, 1303 flow
[2020-10-11 18:26:32,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:32,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:32,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions.
[2020-10-11 18:26:32,538 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8878504672897196
[2020-10-11 18:26:32,539 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions.
[2020-10-11 18:26:32,539 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions.
[2020-10-11 18:26:32,540 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:32,540 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions.
[2020-10-11 18:26:32,543 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:32,546 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:32,546 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:32,546 INFO  L185             Difference]: Start difference. First operand has 140 places, 113 transitions, 507 flow. Second operand 13 states and 1235 transitions.
[2020-10-11 18:26:32,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 176 transitions, 1303 flow
[2020-10-11 18:26:32,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 176 transitions, 1226 flow, removed 37 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:32,590 INFO  L241             Difference]: Finished difference. Result has 155 places, 100 transitions, 409 flow
[2020-10-11 18:26:32,591 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=409, PETRI_PLACES=155, PETRI_TRANSITIONS=100}
[2020-10-11 18:26:32,591 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places.
[2020-10-11 18:26:32,591 INFO  L481      AbstractCegarLoop]: Abstraction has has 155 places, 100 transitions, 409 flow
[2020-10-11 18:26:32,592 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 18:26:32,592 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:32,592 INFO  L255   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]
[2020-10-11 18:26:32,592 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 18:26:32,592 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:32,592 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:32,593 INFO  L82        PathProgramCache]: Analyzing trace with hash 588858555, now seen corresponding path program 2 times
[2020-10-11 18:26:32,593 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:32,593 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819135191]
[2020-10-11 18:26:32,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:32,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:32,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:32,792 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819135191]
[2020-10-11 18:26:32,793 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:32,794 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:32,794 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524046377]
[2020-10-11 18:26:32,795 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:32,795 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:32,796 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:32,797 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:33,572 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:33,572 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 100 transitions, 409 flow. Second operand 10 states.
[2020-10-11 18:26:33,572 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:33,572 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:33,573 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:34,266 INFO  L129       PetriNetUnfolder]: 523/1313 cut-off events.
[2020-10-11 18:26:34,266 INFO  L130       PetriNetUnfolder]: For 12556/12741 co-relation queries the response was YES.
[2020-10-11 18:26:34,285 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 1313 events. 523/1313 cut-off events. For 12556/12741 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9366 event pairs, 138 based on Foata normal form. 46/1290 useless extension candidates. Maximal degree in co-relation 6373. Up to 483 conditions per place. 
[2020-10-11 18:26:34,296 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 22 selfloop transitions, 10 changer transitions 25/133 dead transitions.
[2020-10-11 18:26:34,296 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 133 transitions, 913 flow
[2020-10-11 18:26:34,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:34,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:34,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1388 transitions.
[2020-10-11 18:26:34,301 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.864797507788162
[2020-10-11 18:26:34,301 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1388 transitions.
[2020-10-11 18:26:34,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1388 transitions.
[2020-10-11 18:26:34,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:34,303 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1388 transitions.
[2020-10-11 18:26:34,305 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:34,309 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:34,309 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:34,309 INFO  L185             Difference]: Start difference. First operand has 155 places, 100 transitions, 409 flow. Second operand 15 states and 1388 transitions.
[2020-10-11 18:26:34,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 133 transitions, 913 flow
[2020-10-11 18:26:34,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 781 flow, removed 59 selfloop flow, removed 14 redundant places.
[2020-10-11 18:26:34,325 INFO  L241             Difference]: Finished difference. Result has 147 places, 102 transitions, 430 flow
[2020-10-11 18:26:34,326 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=430, PETRI_PLACES=147, PETRI_TRANSITIONS=102}
[2020-10-11 18:26:34,326 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 33 predicate places.
[2020-10-11 18:26:34,326 INFO  L481      AbstractCegarLoop]: Abstraction has has 147 places, 102 transitions, 430 flow
[2020-10-11 18:26:34,326 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:34,326 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:34,327 INFO  L255   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]
[2020-10-11 18:26:34,327 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 18:26:34,327 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:34,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:34,327 INFO  L82        PathProgramCache]: Analyzing trace with hash -2032198890, now seen corresponding path program 1 times
[2020-10-11 18:26:34,328 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:34,328 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847535457]
[2020-10-11 18:26:34,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:34,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:34,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:34,693 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847535457]
[2020-10-11 18:26:34,694 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:34,694 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:26:34,694 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765218278]
[2020-10-11 18:26:34,695 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:26:34,695 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:34,695 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:26:34,696 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:26:35,957 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:35,958 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 102 transitions, 430 flow. Second operand 11 states.
[2020-10-11 18:26:35,959 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:35,959 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:35,959 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:36,518 INFO  L129       PetriNetUnfolder]: 420/1041 cut-off events.
[2020-10-11 18:26:36,519 INFO  L130       PetriNetUnfolder]: For 9802/9983 co-relation queries the response was YES.
[2020-10-11 18:26:36,534 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 1041 events. 420/1041 cut-off events. For 9802/9983 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6933 event pairs, 131 based on Foata normal form. 29/1008 useless extension candidates. Maximal degree in co-relation 5222. Up to 486 conditions per place. 
[2020-10-11 18:26:36,545 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 23 selfloop transitions, 11 changer transitions 13/123 dead transitions.
[2020-10-11 18:26:36,546 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 123 transitions, 770 flow
[2020-10-11 18:26:36,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 18:26:36,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-10-11 18:26:36,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1109 transitions.
[2020-10-11 18:26:36,550 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8637071651090342
[2020-10-11 18:26:36,550 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1109 transitions.
[2020-10-11 18:26:36,550 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1109 transitions.
[2020-10-11 18:26:36,551 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:36,551 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1109 transitions.
[2020-10-11 18:26:36,554 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 13 states.
[2020-10-11 18:26:36,556 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states.
[2020-10-11 18:26:36,556 INFO  L81            ComplementDD]: Finished complementDD. Result 13 states.
[2020-10-11 18:26:36,556 INFO  L185             Difference]: Start difference. First operand has 147 places, 102 transitions, 430 flow. Second operand 12 states and 1109 transitions.
[2020-10-11 18:26:36,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 123 transitions, 770 flow
[2020-10-11 18:26:36,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 123 transitions, 677 flow, removed 40 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:36,572 INFO  L241             Difference]: Finished difference. Result has 144 places, 104 transitions, 444 flow
[2020-10-11 18:26:36,572 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=444, PETRI_PLACES=144, PETRI_TRANSITIONS=104}
[2020-10-11 18:26:36,573 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 30 predicate places.
[2020-10-11 18:26:36,573 INFO  L481      AbstractCegarLoop]: Abstraction has has 144 places, 104 transitions, 444 flow
[2020-10-11 18:26:36,573 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:26:36,573 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:36,573 INFO  L255   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]
[2020-10-11 18:26:36,573 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 18:26:36,573 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:36,574 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:36,574 INFO  L82        PathProgramCache]: Analyzing trace with hash -19198126, now seen corresponding path program 2 times
[2020-10-11 18:26:36,574 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:36,574 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573447352]
[2020-10-11 18:26:36,575 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:36,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:36,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:36,838 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573447352]
[2020-10-11 18:26:36,838 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:36,838 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-11 18:26:36,838 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600398042]
[2020-10-11 18:26:36,839 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-11 18:26:36,839 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:36,839 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-11 18:26:36,839 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2020-10-11 18:26:38,235 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2020-10-11 18:26:38,236 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 104 transitions, 444 flow. Second operand 12 states.
[2020-10-11 18:26:38,236 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:38,236 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2020-10-11 18:26:38,236 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:38,619 INFO  L129       PetriNetUnfolder]: 377/977 cut-off events.
[2020-10-11 18:26:38,619 INFO  L130       PetriNetUnfolder]: For 6876/7138 co-relation queries the response was YES.
[2020-10-11 18:26:38,630 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4489 conditions, 977 events. 377/977 cut-off events. For 6876/7138 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6388 event pairs, 119 based on Foata normal form. 34/955 useless extension candidates. Maximal degree in co-relation 4404. Up to 458 conditions per place. 
[2020-10-11 18:26:38,639 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 20 selfloop transitions, 10 changer transitions 13/118 dead transitions.
[2020-10-11 18:26:38,640 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 118 transitions, 688 flow
[2020-10-11 18:26:38,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:38,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:38,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1180 transitions.
[2020-10-11 18:26:38,644 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8483105679367362
[2020-10-11 18:26:38,644 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1180 transitions.
[2020-10-11 18:26:38,645 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1180 transitions.
[2020-10-11 18:26:38,645 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:38,646 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1180 transitions.
[2020-10-11 18:26:38,648 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:38,651 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:38,651 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:38,651 INFO  L185             Difference]: Start difference. First operand has 144 places, 104 transitions, 444 flow. Second operand 13 states and 1180 transitions.
[2020-10-11 18:26:38,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 118 transitions, 688 flow
[2020-10-11 18:26:38,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 118 transitions, 618 flow, removed 23 selfloop flow, removed 10 redundant places.
[2020-10-11 18:26:38,663 INFO  L241             Difference]: Finished difference. Result has 147 places, 104 transitions, 441 flow
[2020-10-11 18:26:38,663 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=441, PETRI_PLACES=147, PETRI_TRANSITIONS=104}
[2020-10-11 18:26:38,664 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 33 predicate places.
[2020-10-11 18:26:38,664 INFO  L481      AbstractCegarLoop]: Abstraction has has 147 places, 104 transitions, 441 flow
[2020-10-11 18:26:38,664 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-11 18:26:38,664 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:38,664 INFO  L255   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]
[2020-10-11 18:26:38,664 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 18:26:38,664 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:38,665 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:38,665 INFO  L82        PathProgramCache]: Analyzing trace with hash -1091497485, now seen corresponding path program 1 times
[2020-10-11 18:26:38,665 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:38,665 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277860819]
[2020-10-11 18:26:38,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:38,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:38,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:38,879 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277860819]
[2020-10-11 18:26:38,879 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:38,879 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:38,880 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519924864]
[2020-10-11 18:26:38,880 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:38,880 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:38,881 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:38,881 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:39,537 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:39,538 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 104 transitions, 441 flow. Second operand 10 states.
[2020-10-11 18:26:39,538 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:39,538 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:39,539 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:40,263 INFO  L129       PetriNetUnfolder]: 496/1260 cut-off events.
[2020-10-11 18:26:40,264 INFO  L130       PetriNetUnfolder]: For 8635/8911 co-relation queries the response was YES.
[2020-10-11 18:26:40,277 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 1260 events. 496/1260 cut-off events. For 8635/8911 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8922 event pairs, 132 based on Foata normal form. 55/1253 useless extension candidates. Maximal degree in co-relation 5579. Up to 480 conditions per place. 
[2020-10-11 18:26:40,285 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 26 selfloop transitions, 12 changer transitions 32/146 dead transitions.
[2020-10-11 18:26:40,285 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 146 transitions, 985 flow
[2020-10-11 18:26:40,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2020-10-11 18:26:40,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2020-10-11 18:26:40,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1483 transitions.
[2020-10-11 18:26:40,300 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8662383177570093
[2020-10-11 18:26:40,300 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1483 transitions.
[2020-10-11 18:26:40,300 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1483 transitions.
[2020-10-11 18:26:40,302 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:40,302 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1483 transitions.
[2020-10-11 18:26:40,305 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 17 states.
[2020-10-11 18:26:40,308 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states.
[2020-10-11 18:26:40,309 INFO  L81            ComplementDD]: Finished complementDD. Result 17 states.
[2020-10-11 18:26:40,309 INFO  L185             Difference]: Start difference. First operand has 147 places, 104 transitions, 441 flow. Second operand 16 states and 1483 transitions.
[2020-10-11 18:26:40,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 146 transitions, 985 flow
[2020-10-11 18:26:40,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 907 flow, removed 30 selfloop flow, removed 14 redundant places.
[2020-10-11 18:26:40,325 INFO  L241             Difference]: Finished difference. Result has 154 places, 113 transitions, 566 flow
[2020-10-11 18:26:40,325 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=566, PETRI_PLACES=154, PETRI_TRANSITIONS=113}
[2020-10-11 18:26:40,326 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 40 predicate places.
[2020-10-11 18:26:40,326 INFO  L481      AbstractCegarLoop]: Abstraction has has 154 places, 113 transitions, 566 flow
[2020-10-11 18:26:40,326 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:40,326 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:40,326 INFO  L255   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]
[2020-10-11 18:26:40,327 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 18:26:40,327 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:40,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:40,327 INFO  L82        PathProgramCache]: Analyzing trace with hash -1190755115, now seen corresponding path program 2 times
[2020-10-11 18:26:40,327 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:40,328 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686014619]
[2020-10-11 18:26:40,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:40,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:40,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:40,593 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686014619]
[2020-10-11 18:26:40,593 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:40,594 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:26:40,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822496823]
[2020-10-11 18:26:40,595 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:26:40,595 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:40,595 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:26:40,595 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:26:41,219 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2020-10-11 18:26:41,220 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 113 transitions, 566 flow. Second operand 11 states.
[2020-10-11 18:26:41,220 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:41,221 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2020-10-11 18:26:41,221 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:41,740 INFO  L129       PetriNetUnfolder]: 412/1093 cut-off events.
[2020-10-11 18:26:41,740 INFO  L130       PetriNetUnfolder]: For 11825/12154 co-relation queries the response was YES.
[2020-10-11 18:26:41,752 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5930 conditions, 1093 events. 412/1093 cut-off events. For 11825/12154 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7578 event pairs, 133 based on Foata normal form. 61/1094 useless extension candidates. Maximal degree in co-relation 5841. Up to 401 conditions per place. 
[2020-10-11 18:26:41,762 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 22 selfloop transitions, 15 changer transitions 22/134 dead transitions.
[2020-10-11 18:26:41,762 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 134 transitions, 948 flow
[2020-10-11 18:26:41,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:41,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:41,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1278 transitions.
[2020-10-11 18:26:41,766 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8531375166889186
[2020-10-11 18:26:41,766 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1278 transitions.
[2020-10-11 18:26:41,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1278 transitions.
[2020-10-11 18:26:41,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:41,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1278 transitions.
[2020-10-11 18:26:41,769 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:41,771 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:41,772 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:41,772 INFO  L185             Difference]: Start difference. First operand has 154 places, 113 transitions, 566 flow. Second operand 14 states and 1278 transitions.
[2020-10-11 18:26:41,772 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 134 transitions, 948 flow
[2020-10-11 18:26:41,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 134 transitions, 868 flow, removed 38 selfloop flow, removed 8 redundant places.
[2020-10-11 18:26:41,790 INFO  L241             Difference]: Finished difference. Result has 156 places, 112 transitions, 563 flow
[2020-10-11 18:26:41,790 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=563, PETRI_PLACES=156, PETRI_TRANSITIONS=112}
[2020-10-11 18:26:41,791 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 42 predicate places.
[2020-10-11 18:26:41,791 INFO  L481      AbstractCegarLoop]: Abstraction has has 156 places, 112 transitions, 563 flow
[2020-10-11 18:26:41,791 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:26:41,791 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:41,791 INFO  L255   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]
[2020-10-11 18:26:41,791 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 18:26:41,792 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:41,792 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:41,792 INFO  L82        PathProgramCache]: Analyzing trace with hash -848363879, now seen corresponding path program 1 times
[2020-10-11 18:26:41,792 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:41,793 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915643249]
[2020-10-11 18:26:41,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:41,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:42,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:42,021 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915643249]
[2020-10-11 18:26:42,021 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:42,022 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:26:42,022 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704618537]
[2020-10-11 18:26:42,022 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:26:42,023 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:42,023 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:26:42,023 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:26:43,295 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2020-10-11 18:26:43,296 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 112 transitions, 563 flow. Second operand 11 states.
[2020-10-11 18:26:43,296 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:43,296 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2020-10-11 18:26:43,296 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:43,748 INFO  L129       PetriNetUnfolder]: 357/1018 cut-off events.
[2020-10-11 18:26:43,748 INFO  L130       PetriNetUnfolder]: For 10816/11093 co-relation queries the response was YES.
[2020-10-11 18:26:43,756 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5426 conditions, 1018 events. 357/1018 cut-off events. For 10816/11093 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7151 event pairs, 82 based on Foata normal form. 53/1023 useless extension candidates. Maximal degree in co-relation 5333. Up to 379 conditions per place. 
[2020-10-11 18:26:43,762 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 25 selfloop transitions, 15 changer transitions 19/134 dead transitions.
[2020-10-11 18:26:43,763 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 134 transitions, 999 flow
[2020-10-11 18:26:43,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:43,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:43,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1190 transitions.
[2020-10-11 18:26:43,767 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8554996405463695
[2020-10-11 18:26:43,767 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1190 transitions.
[2020-10-11 18:26:43,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1190 transitions.
[2020-10-11 18:26:43,768 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:43,768 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1190 transitions.
[2020-10-11 18:26:43,770 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:43,772 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:43,772 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:43,772 INFO  L185             Difference]: Start difference. First operand has 156 places, 112 transitions, 563 flow. Second operand 13 states and 1190 transitions.
[2020-10-11 18:26:43,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 134 transitions, 999 flow
[2020-10-11 18:26:43,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 134 transitions, 881 flow, removed 48 selfloop flow, removed 15 redundant places.
[2020-10-11 18:26:43,789 INFO  L241             Difference]: Finished difference. Result has 154 places, 114 transitions, 600 flow
[2020-10-11 18:26:43,789 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=600, PETRI_PLACES=154, PETRI_TRANSITIONS=114}
[2020-10-11 18:26:43,790 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 40 predicate places.
[2020-10-11 18:26:43,790 INFO  L481      AbstractCegarLoop]: Abstraction has has 154 places, 114 transitions, 600 flow
[2020-10-11 18:26:43,790 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:26:43,790 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:43,790 INFO  L255   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]
[2020-10-11 18:26:43,791 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 18:26:43,791 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:43,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:43,791 INFO  L82        PathProgramCache]: Analyzing trace with hash -1725179555, now seen corresponding path program 2 times
[2020-10-11 18:26:43,791 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:43,792 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34280317]
[2020-10-11 18:26:43,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:43,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:44,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:44,022 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34280317]
[2020-10-11 18:26:44,022 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:44,023 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:44,023 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035329044]
[2020-10-11 18:26:44,023 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:44,023 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:44,024 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:44,024 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:44,651 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107
[2020-10-11 18:26:44,651 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 114 transitions, 600 flow. Second operand 10 states.
[2020-10-11 18:26:44,651 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:44,651 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107
[2020-10-11 18:26:44,651 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:45,069 INFO  L129       PetriNetUnfolder]: 348/960 cut-off events.
[2020-10-11 18:26:45,070 INFO  L130       PetriNetUnfolder]: For 13914/14233 co-relation queries the response was YES.
[2020-10-11 18:26:45,078 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 960 events. 348/960 cut-off events. For 13914/14233 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6490 event pairs, 85 based on Foata normal form. 45/953 useless extension candidates. Maximal degree in co-relation 5755. Up to 292 conditions per place. 
[2020-10-11 18:26:45,151 INFO  L132   encePairwiseOnDemand]: 98/107 looper letters, 28 selfloop transitions, 16 changer transitions 19/140 dead transitions.
[2020-10-11 18:26:45,151 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 140 transitions, 1148 flow
[2020-10-11 18:26:45,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-11 18:26:45,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-10-11 18:26:45,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1044 transitions.
[2020-10-11 18:26:45,153 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.887000849617672
[2020-10-11 18:26:45,153 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1044 transitions.
[2020-10-11 18:26:45,154 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1044 transitions.
[2020-10-11 18:26:45,154 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:45,154 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1044 transitions.
[2020-10-11 18:26:45,156 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 12 states.
[2020-10-11 18:26:45,158 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states.
[2020-10-11 18:26:45,158 INFO  L81            ComplementDD]: Finished complementDD. Result 12 states.
[2020-10-11 18:26:45,158 INFO  L185             Difference]: Start difference. First operand has 154 places, 114 transitions, 600 flow. Second operand 11 states and 1044 transitions.
[2020-10-11 18:26:45,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 140 transitions, 1148 flow
[2020-10-11 18:26:45,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 140 transitions, 1083 flow, removed 19 selfloop flow, removed 8 redundant places.
[2020-10-11 18:26:45,173 INFO  L241             Difference]: Finished difference. Result has 157 places, 116 transitions, 667 flow
[2020-10-11 18:26:45,174 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=667, PETRI_PLACES=157, PETRI_TRANSITIONS=116}
[2020-10-11 18:26:45,174 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 43 predicate places.
[2020-10-11 18:26:45,174 INFO  L481      AbstractCegarLoop]: Abstraction has has 157 places, 116 transitions, 667 flow
[2020-10-11 18:26:45,174 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:45,174 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:45,175 INFO  L255   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]
[2020-10-11 18:26:45,175 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 18:26:45,175 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:45,175 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:45,175 INFO  L82        PathProgramCache]: Analyzing trace with hash 1921354224, now seen corresponding path program 1 times
[2020-10-11 18:26:45,175 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:45,176 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744487963]
[2020-10-11 18:26:45,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:45,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:45,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:45,394 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744487963]
[2020-10-11 18:26:45,394 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:45,394 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-11 18:26:45,394 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588369460]
[2020-10-11 18:26:45,395 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-11 18:26:45,395 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:45,395 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-11 18:26:45,395 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2020-10-11 18:26:46,218 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2020-10-11 18:26:46,219 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 116 transitions, 667 flow. Second operand 12 states.
[2020-10-11 18:26:46,219 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:46,219 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2020-10-11 18:26:46,219 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:46,610 INFO  L129       PetriNetUnfolder]: 266/794 cut-off events.
[2020-10-11 18:26:46,610 INFO  L130       PetriNetUnfolder]: For 14747/15087 co-relation queries the response was YES.
[2020-10-11 18:26:46,617 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 794 events. 266/794 cut-off events. For 14747/15087 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5186 event pairs, 41 based on Foata normal form. 45/796 useless extension candidates. Maximal degree in co-relation 5151. Up to 298 conditions per place. 
[2020-10-11 18:26:46,623 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 28 selfloop transitions, 25 changer transitions 10/138 dead transitions.
[2020-10-11 18:26:46,623 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 138 transitions, 1152 flow
[2020-10-11 18:26:46,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:46,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:46,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1275 transitions.
[2020-10-11 18:26:46,625 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8511348464619493
[2020-10-11 18:26:46,626 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1275 transitions.
[2020-10-11 18:26:46,626 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1275 transitions.
[2020-10-11 18:26:46,626 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:46,627 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1275 transitions.
[2020-10-11 18:26:46,628 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:46,630 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:46,631 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:46,631 INFO  L185             Difference]: Start difference. First operand has 157 places, 116 transitions, 667 flow. Second operand 14 states and 1275 transitions.
[2020-10-11 18:26:46,631 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 138 transitions, 1152 flow
[2020-10-11 18:26:46,659 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 138 transitions, 981 flow, removed 74 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:46,662 INFO  L241             Difference]: Finished difference. Result has 160 places, 123 transitions, 797 flow
[2020-10-11 18:26:46,662 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=797, PETRI_PLACES=160, PETRI_TRANSITIONS=123}
[2020-10-11 18:26:46,663 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 46 predicate places.
[2020-10-11 18:26:46,663 INFO  L481      AbstractCegarLoop]: Abstraction has has 160 places, 123 transitions, 797 flow
[2020-10-11 18:26:46,663 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-11 18:26:46,663 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:46,663 INFO  L255   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]
[2020-10-11 18:26:46,663 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 18:26:46,664 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:46,664 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:46,664 INFO  L82        PathProgramCache]: Analyzing trace with hash 1192989518, now seen corresponding path program 2 times
[2020-10-11 18:26:46,664 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:46,665 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335544242]
[2020-10-11 18:26:46,665 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:46,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:47,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:47,004 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335544242]
[2020-10-11 18:26:47,004 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:47,004 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-10-11 18:26:47,004 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889950646]
[2020-10-11 18:26:47,005 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-11 18:26:47,005 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:47,005 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-11 18:26:47,006 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2020-10-11 18:26:48,732 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107
[2020-10-11 18:26:48,733 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 123 transitions, 797 flow. Second operand 13 states.
[2020-10-11 18:26:48,733 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:48,733 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107
[2020-10-11 18:26:48,733 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:49,249 INFO  L129       PetriNetUnfolder]: 275/850 cut-off events.
[2020-10-11 18:26:49,249 INFO  L130       PetriNetUnfolder]: For 10946/11429 co-relation queries the response was YES.
[2020-10-11 18:26:49,260 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 850 events. 275/850 cut-off events. For 10946/11429 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5685 event pairs, 76 based on Foata normal form. 44/850 useless extension candidates. Maximal degree in co-relation 4855. Up to 380 conditions per place. 
[2020-10-11 18:26:49,267 INFO  L132   encePairwiseOnDemand]: 94/107 looper letters, 35 selfloop transitions, 16 changer transitions 10/135 dead transitions.
[2020-10-11 18:26:49,267 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 135 transitions, 1119 flow
[2020-10-11 18:26:49,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:49,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:49,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1256 transitions.
[2020-10-11 18:26:49,270 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8384512683578104
[2020-10-11 18:26:49,270 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1256 transitions.
[2020-10-11 18:26:49,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1256 transitions.
[2020-10-11 18:26:49,271 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:49,271 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1256 transitions.
[2020-10-11 18:26:49,272 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:49,274 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:49,274 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:49,275 INFO  L185             Difference]: Start difference. First operand has 160 places, 123 transitions, 797 flow. Second operand 14 states and 1256 transitions.
[2020-10-11 18:26:49,275 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 135 transitions, 1119 flow
[2020-10-11 18:26:49,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 135 transitions, 977 flow, removed 61 selfloop flow, removed 11 redundant places.
[2020-10-11 18:26:49,300 INFO  L241             Difference]: Finished difference. Result has 163 places, 124 transitions, 774 flow
[2020-10-11 18:26:49,300 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=774, PETRI_PLACES=163, PETRI_TRANSITIONS=124}
[2020-10-11 18:26:49,301 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 49 predicate places.
[2020-10-11 18:26:49,301 INFO  L481      AbstractCegarLoop]: Abstraction has has 163 places, 124 transitions, 774 flow
[2020-10-11 18:26:49,301 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-11 18:26:49,301 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:49,301 INFO  L255   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]
[2020-10-11 18:26:49,301 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 18:26:49,302 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:49,302 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:49,302 INFO  L82        PathProgramCache]: Analyzing trace with hash 414438922, now seen corresponding path program 3 times
[2020-10-11 18:26:49,302 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:49,302 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462373754]
[2020-10-11 18:26:49,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:49,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:49,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:49,711 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462373754]
[2020-10-11 18:26:49,714 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:49,714 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-10-11 18:26:49,716 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812928078]
[2020-10-11 18:26:49,717 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-11 18:26:49,717 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:49,718 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-11 18:26:49,723 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2020-10-11 18:26:51,316 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107
[2020-10-11 18:26:51,317 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 124 transitions, 774 flow. Second operand 13 states.
[2020-10-11 18:26:51,317 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:51,317 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107
[2020-10-11 18:26:51,317 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:51,924 INFO  L129       PetriNetUnfolder]: 277/828 cut-off events.
[2020-10-11 18:26:51,924 INFO  L130       PetriNetUnfolder]: For 10942/11329 co-relation queries the response was YES.
[2020-10-11 18:26:51,931 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 828 events. 277/828 cut-off events. For 10942/11329 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5386 event pairs, 75 based on Foata normal form. 49/833 useless extension candidates. Maximal degree in co-relation 4754. Up to 376 conditions per place. 
[2020-10-11 18:26:51,937 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 33 selfloop transitions, 20 changer transitions 10/137 dead transitions.
[2020-10-11 18:26:51,938 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 137 transitions, 1122 flow
[2020-10-11 18:26:51,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:51,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:51,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1344 transitions.
[2020-10-11 18:26:51,940 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8373831775700935
[2020-10-11 18:26:51,941 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1344 transitions.
[2020-10-11 18:26:51,941 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1344 transitions.
[2020-10-11 18:26:51,941 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:51,941 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1344 transitions.
[2020-10-11 18:26:51,943 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:51,945 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:51,945 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:51,946 INFO  L185             Difference]: Start difference. First operand has 163 places, 124 transitions, 774 flow. Second operand 15 states and 1344 transitions.
[2020-10-11 18:26:51,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 137 transitions, 1122 flow
[2020-10-11 18:26:51,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 137 transitions, 1017 flow, removed 38 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:51,968 INFO  L241             Difference]: Finished difference. Result has 166 places, 125 transitions, 799 flow
[2020-10-11 18:26:51,968 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=799, PETRI_PLACES=166, PETRI_TRANSITIONS=125}
[2020-10-11 18:26:51,969 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places.
[2020-10-11 18:26:51,969 INFO  L481      AbstractCegarLoop]: Abstraction has has 166 places, 125 transitions, 799 flow
[2020-10-11 18:26:51,969 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-11 18:26:51,969 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:51,969 INFO  L255   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]
[2020-10-11 18:26:51,969 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-11 18:26:51,970 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:51,970 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:51,970 INFO  L82        PathProgramCache]: Analyzing trace with hash 475861488, now seen corresponding path program 1 times
[2020-10-11 18:26:51,970 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:51,971 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614650898]
[2020-10-11 18:26:51,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:52,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:52,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:52,092 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614650898]
[2020-10-11 18:26:52,092 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:52,092 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:52,092 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672547940]
[2020-10-11 18:26:52,093 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:52,093 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:52,093 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:52,093 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:52,242 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:52,242 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 125 transitions, 799 flow. Second operand 6 states.
[2020-10-11 18:26:52,242 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:52,243 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:52,243 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:53,009 INFO  L129       PetriNetUnfolder]: 2116/4507 cut-off events.
[2020-10-11 18:26:53,009 INFO  L130       PetriNetUnfolder]: For 25647/26016 co-relation queries the response was YES.
[2020-10-11 18:26:53,060 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 16163 conditions, 4507 events. 2116/4507 cut-off events. For 25647/26016 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 40096 event pairs, 246 based on Foata normal form. 87/3984 useless extension candidates. Maximal degree in co-relation 16072. Up to 1214 conditions per place. 
[2020-10-11 18:26:53,087 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 23 selfloop transitions, 19 changer transitions 0/156 dead transitions.
[2020-10-11 18:26:53,088 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 156 transitions, 945 flow
[2020-10-11 18:26:53,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:53,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:53,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions.
[2020-10-11 18:26:53,090 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9148494288681205
[2020-10-11 18:26:53,090 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 881 transitions.
[2020-10-11 18:26:53,090 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions.
[2020-10-11 18:26:53,091 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:53,091 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions.
[2020-10-11 18:26:53,092 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:53,093 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:53,093 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:53,094 INFO  L185             Difference]: Start difference. First operand has 166 places, 125 transitions, 799 flow. Second operand 9 states and 881 transitions.
[2020-10-11 18:26:53,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 156 transitions, 945 flow
[2020-10-11 18:26:53,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 156 transitions, 875 flow, removed 20 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:53,170 INFO  L241             Difference]: Finished difference. Result has 161 places, 142 transitions, 863 flow
[2020-10-11 18:26:53,170 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=863, PETRI_PLACES=161, PETRI_TRANSITIONS=142}
[2020-10-11 18:26:53,171 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 47 predicate places.
[2020-10-11 18:26:53,171 INFO  L481      AbstractCegarLoop]: Abstraction has has 161 places, 142 transitions, 863 flow
[2020-10-11 18:26:53,171 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:53,171 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:53,171 INFO  L255   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]
[2020-10-11 18:26:53,171 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-11 18:26:53,171 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:53,172 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:53,172 INFO  L82        PathProgramCache]: Analyzing trace with hash -54954886, now seen corresponding path program 1 times
[2020-10-11 18:26:53,172 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:53,172 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351795844]
[2020-10-11 18:26:53,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:53,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:53,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:53,427 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351795844]
[2020-10-11 18:26:53,427 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:53,427 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:26:53,428 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909693215]
[2020-10-11 18:26:53,428 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:26:53,428 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:53,428 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:26:53,429 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:26:54,419 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:54,419 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 142 transitions, 863 flow. Second operand 11 states.
[2020-10-11 18:26:54,419 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:54,419 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:54,420 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:55,300 INFO  L129       PetriNetUnfolder]: 1210/3978 cut-off events.
[2020-10-11 18:26:55,300 INFO  L130       PetriNetUnfolder]: For 17219/19568 co-relation queries the response was YES.
[2020-10-11 18:26:55,330 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 14549 conditions, 3978 events. 1210/3978 cut-off events. For 17219/19568 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 41804 event pairs, 475 based on Foata normal form. 153/3651 useless extension candidates. Maximal degree in co-relation 14457. Up to 1299 conditions per place. 
[2020-10-11 18:26:55,353 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 33 selfloop transitions, 25 changer transitions 0/156 dead transitions.
[2020-10-11 18:26:55,353 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 156 transitions, 1149 flow
[2020-10-11 18:26:55,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:55,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:55,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1192 transitions.
[2020-10-11 18:26:55,356 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8569374550682962
[2020-10-11 18:26:55,356 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1192 transitions.
[2020-10-11 18:26:55,356 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1192 transitions.
[2020-10-11 18:26:55,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:55,356 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1192 transitions.
[2020-10-11 18:26:55,358 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:55,360 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:55,360 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:55,360 INFO  L185             Difference]: Start difference. First operand has 161 places, 142 transitions, 863 flow. Second operand 13 states and 1192 transitions.
[2020-10-11 18:26:55,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 156 transitions, 1149 flow
[2020-10-11 18:26:55,394 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 156 transitions, 1137 flow, removed 5 selfloop flow, removed 1 redundant places.
[2020-10-11 18:26:55,397 INFO  L241             Difference]: Finished difference. Result has 179 places, 150 transitions, 1077 flow
[2020-10-11 18:26:55,397 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1077, PETRI_PLACES=179, PETRI_TRANSITIONS=150}
[2020-10-11 18:26:55,397 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places.
[2020-10-11 18:26:55,397 INFO  L481      AbstractCegarLoop]: Abstraction has has 179 places, 150 transitions, 1077 flow
[2020-10-11 18:26:55,398 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:26:55,398 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:55,398 INFO  L255   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]
[2020-10-11 18:26:55,398 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-11 18:26:55,398 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:55,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:55,398 INFO  L82        PathProgramCache]: Analyzing trace with hash -1807527846, now seen corresponding path program 1 times
[2020-10-11 18:26:55,399 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:55,399 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921832062]
[2020-10-11 18:26:55,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:55,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:55,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:55,520 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921832062]
[2020-10-11 18:26:55,521 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:55,521 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 18:26:55,521 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33703249]
[2020-10-11 18:26:55,522 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 18:26:55,523 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:55,523 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 18:26:55,523 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-11 18:26:55,714 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:55,714 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 150 transitions, 1077 flow. Second operand 7 states.
[2020-10-11 18:26:55,714 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:55,715 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:55,715 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:56,580 INFO  L129       PetriNetUnfolder]: 2352/5140 cut-off events.
[2020-10-11 18:26:56,580 INFO  L130       PetriNetUnfolder]: For 26381/35420 co-relation queries the response was YES.
[2020-10-11 18:26:56,630 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 21854 conditions, 5140 events. 2352/5140 cut-off events. For 26381/35420 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 48489 event pairs, 142 based on Foata normal form. 477/4936 useless extension candidates. Maximal degree in co-relation 21756. Up to 2377 conditions per place. 
[2020-10-11 18:26:56,657 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 25 selfloop transitions, 37 changer transitions 0/184 dead transitions.
[2020-10-11 18:26:56,658 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 184 transitions, 1430 flow
[2020-10-11 18:26:56,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 18:26:56,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-10-11 18:26:56,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1176 transitions.
[2020-10-11 18:26:56,661 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9158878504672897
[2020-10-11 18:26:56,661 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1176 transitions.
[2020-10-11 18:26:56,661 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1176 transitions.
[2020-10-11 18:26:56,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:56,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1176 transitions.
[2020-10-11 18:26:56,664 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 13 states.
[2020-10-11 18:26:56,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states.
[2020-10-11 18:26:56,665 INFO  L81            ComplementDD]: Finished complementDD. Result 13 states.
[2020-10-11 18:26:56,666 INFO  L185             Difference]: Start difference. First operand has 179 places, 150 transitions, 1077 flow. Second operand 12 states and 1176 transitions.
[2020-10-11 18:26:56,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 184 transitions, 1430 flow
[2020-10-11 18:26:56,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 184 transitions, 1318 flow, removed 50 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:56,731 INFO  L241             Difference]: Finished difference. Result has 191 places, 169 transitions, 1245 flow
[2020-10-11 18:26:56,731 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1245, PETRI_PLACES=191, PETRI_TRANSITIONS=169}
[2020-10-11 18:26:56,731 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 77 predicate places.
[2020-10-11 18:26:56,731 INFO  L481      AbstractCegarLoop]: Abstraction has has 191 places, 169 transitions, 1245 flow
[2020-10-11 18:26:56,731 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 18:26:56,731 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:56,732 INFO  L255   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]
[2020-10-11 18:26:56,732 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-11 18:26:56,732 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:56,732 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:56,732 INFO  L82        PathProgramCache]: Analyzing trace with hash -863532329, now seen corresponding path program 1 times
[2020-10-11 18:26:56,733 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:56,733 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530107409]
[2020-10-11 18:26:56,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:56,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:56,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:56,835 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530107409]
[2020-10-11 18:26:56,835 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:56,835 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:56,836 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648902535]
[2020-10-11 18:26:56,836 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:56,836 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:56,837 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:56,837 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:57,034 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:57,034 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 169 transitions, 1245 flow. Second operand 6 states.
[2020-10-11 18:26:57,034 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:57,035 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:57,035 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:57,919 INFO  L129       PetriNetUnfolder]: 1862/5890 cut-off events.
[2020-10-11 18:26:57,919 INFO  L130       PetriNetUnfolder]: For 36724/48467 co-relation queries the response was YES.
[2020-10-11 18:26:57,980 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 26294 conditions, 5890 events. 1862/5890 cut-off events. For 36724/48467 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 66186 event pairs, 332 based on Foata normal form. 151/5298 useless extension candidates. Maximal degree in co-relation 26192. Up to 2068 conditions per place. 
[2020-10-11 18:26:58,002 INFO  L132   encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 16 changer transitions 8/196 dead transitions.
[2020-10-11 18:26:58,002 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 1587 flow
[2020-10-11 18:26:58,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:58,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:58,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions.
[2020-10-11 18:26:58,004 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9241952232606438
[2020-10-11 18:26:58,005 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 890 transitions.
[2020-10-11 18:26:58,005 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions.
[2020-10-11 18:26:58,005 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:58,005 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions.
[2020-10-11 18:26:58,006 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:58,008 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:58,008 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:58,008 INFO  L185             Difference]: Start difference. First operand has 191 places, 169 transitions, 1245 flow. Second operand 9 states and 890 transitions.
[2020-10-11 18:26:58,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 1587 flow
[2020-10-11 18:26:58,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 196 transitions, 1476 flow, removed 46 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:58,200 INFO  L241             Difference]: Finished difference. Result has 202 places, 182 transitions, 1375 flow
[2020-10-11 18:26:58,200 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1375, PETRI_PLACES=202, PETRI_TRANSITIONS=182}
[2020-10-11 18:26:58,200 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 88 predicate places.
[2020-10-11 18:26:58,201 INFO  L481      AbstractCegarLoop]: Abstraction has has 202 places, 182 transitions, 1375 flow
[2020-10-11 18:26:58,201 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:58,201 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:58,201 INFO  L255   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]
[2020-10-11 18:26:58,201 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-11 18:26:58,201 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:58,201 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:58,202 INFO  L82        PathProgramCache]: Analyzing trace with hash 953343011, now seen corresponding path program 1 times
[2020-10-11 18:26:58,202 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:58,202 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762657593]
[2020-10-11 18:26:58,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:58,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:58,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:26:58,335 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762657593]
[2020-10-11 18:26:58,335 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:58,335 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-11 18:26:58,335 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001426106]
[2020-10-11 18:26:58,335 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 18:26:58,336 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:58,336 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 18:26:58,336 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-11 18:26:58,461 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:58,462 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 182 transitions, 1375 flow. Second operand 8 states.
[2020-10-11 18:26:58,462 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:58,462 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:58,462 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:59,772 INFO  L129       PetriNetUnfolder]: 3202/6573 cut-off events.
[2020-10-11 18:26:59,773 INFO  L130       PetriNetUnfolder]: For 57539/75120 co-relation queries the response was YES.
[2020-10-11 18:26:59,836 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 33265 conditions, 6573 events. 3202/6573 cut-off events. For 57539/75120 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 63179 event pairs, 29 based on Foata normal form. 818/6422 useless extension candidates. Maximal degree in co-relation 33157. Up to 2881 conditions per place. 
[2020-10-11 18:26:59,852 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 19 selfloop transitions, 57 changer transitions 31/202 dead transitions.
[2020-10-11 18:26:59,852 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 202 transitions, 1751 flow
[2020-10-11 18:26:59,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:59,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:59,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1471 transitions.
[2020-10-11 18:26:59,855 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9165109034267913
[2020-10-11 18:26:59,855 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1471 transitions.
[2020-10-11 18:26:59,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1471 transitions.
[2020-10-11 18:26:59,855 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:59,856 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1471 transitions.
[2020-10-11 18:26:59,857 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:59,859 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:59,859 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:59,859 INFO  L185             Difference]: Start difference. First operand has 202 places, 182 transitions, 1375 flow. Second operand 15 states and 1471 transitions.
[2020-10-11 18:26:59,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 202 transitions, 1751 flow
[2020-10-11 18:26:59,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 1651 flow, removed 33 selfloop flow, removed 11 redundant places.
[2020-10-11 18:26:59,993 INFO  L241             Difference]: Finished difference. Result has 208 places, 167 transitions, 1272 flow
[2020-10-11 18:26:59,993 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1272, PETRI_PLACES=208, PETRI_TRANSITIONS=167}
[2020-10-11 18:26:59,994 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 94 predicate places.
[2020-10-11 18:26:59,994 INFO  L481      AbstractCegarLoop]: Abstraction has has 208 places, 167 transitions, 1272 flow
[2020-10-11 18:26:59,994 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 18:26:59,994 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:59,994 INFO  L255   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]
[2020-10-11 18:26:59,994 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-11 18:26:59,994 INFO  L429      AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:26:59,994 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:59,994 INFO  L82        PathProgramCache]: Analyzing trace with hash -64248712, now seen corresponding path program 1 times
[2020-10-11 18:26:59,995 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:59,995 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496320850]
[2020-10-11 18:26:59,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:27:00,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:27:00,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:27:00,145 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496320850]
[2020-10-11 18:27:00,145 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:27:00,145 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-11 18:27:00,145 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245705096]
[2020-10-11 18:27:00,146 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 18:27:00,146 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:27:00,146 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 18:27:00,146 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-10-11 18:27:00,356 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:27:00,357 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 167 transitions, 1272 flow. Second operand 9 states.
[2020-10-11 18:27:00,357 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:27:00,357 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:27:00,357 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:27:01,574 INFO  L129       PetriNetUnfolder]: 2803/5853 cut-off events.
[2020-10-11 18:27:01,574 INFO  L130       PetriNetUnfolder]: For 60355/82316 co-relation queries the response was YES.
[2020-10-11 18:27:02,748 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 32977 conditions, 5853 events. 2803/5853 cut-off events. For 60355/82316 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 57928 event pairs, 0 based on Foata normal form. 859/5752 useless extension candidates. Maximal degree in co-relation 32910. Up to 2535 conditions per place. 
[2020-10-11 18:27:02,763 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 12 selfloop transitions, 63 changer transitions 21/189 dead transitions.
[2020-10-11 18:27:02,764 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 189 transitions, 1677 flow
[2020-10-11 18:27:02,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2020-10-11 18:27:02,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2020-10-11 18:27:02,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1750 transitions.
[2020-10-11 18:27:02,775 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9086188992731049
[2020-10-11 18:27:02,777 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1750 transitions.
[2020-10-11 18:27:02,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1750 transitions.
[2020-10-11 18:27:02,778 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:27:02,778 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1750 transitions.
[2020-10-11 18:27:02,780 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 19 states.
[2020-10-11 18:27:02,785 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states.
[2020-10-11 18:27:02,785 INFO  L81            ComplementDD]: Finished complementDD. Result 19 states.
[2020-10-11 18:27:02,785 INFO  L185             Difference]: Start difference. First operand has 208 places, 167 transitions, 1272 flow. Second operand 18 states and 1750 transitions.
[2020-10-11 18:27:02,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 189 transitions, 1677 flow
[2020-10-11 18:27:03,737 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 189 transitions, 1158 flow, removed 200 selfloop flow, removed 41 redundant places.
[2020-10-11 18:27:03,740 INFO  L241             Difference]: Finished difference. Result has 178 places, 164 transitions, 973 flow
[2020-10-11 18:27:03,740 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=973, PETRI_PLACES=178, PETRI_TRANSITIONS=164}
[2020-10-11 18:27:03,741 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 64 predicate places.
[2020-10-11 18:27:03,741 INFO  L481      AbstractCegarLoop]: Abstraction has has 178 places, 164 transitions, 973 flow
[2020-10-11 18:27:03,741 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 18:27:03,741 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:27:03,741 INFO  L255   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]
[2020-10-11 18:27:03,741 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-11 18:27:03,741 INFO  L429      AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:27:03,742 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:27:03,742 INFO  L82        PathProgramCache]: Analyzing trace with hash -76424068, now seen corresponding path program 1 times
[2020-10-11 18:27:03,742 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:27:03,742 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625995020]
[2020-10-11 18:27:03,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:27:03,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:27:03,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:27:03,883 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625995020]
[2020-10-11 18:27:03,883 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:27:03,883 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 18:27:03,883 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308083168]
[2020-10-11 18:27:03,884 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 18:27:03,884 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:27:03,884 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 18:27:03,884 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-10-11 18:27:04,140 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107
[2020-10-11 18:27:04,141 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 164 transitions, 973 flow. Second operand 7 states.
[2020-10-11 18:27:04,141 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:27:04,142 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107
[2020-10-11 18:27:04,142 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:27:05,135 INFO  L129       PetriNetUnfolder]: 3909/9503 cut-off events.
[2020-10-11 18:27:05,136 INFO  L130       PetriNetUnfolder]: For 26607/29970 co-relation queries the response was YES.
[2020-10-11 18:27:05,235 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 31790 conditions, 9503 events. 3909/9503 cut-off events. For 26607/29970 co-relation queries the response was YES. Maximal size of possible extension queue 1672. Compared 113045 event pairs, 0 based on Foata normal form. 3/8178 useless extension candidates. Maximal degree in co-relation 31707. Up to 1288 conditions per place. 
[2020-10-11 18:27:05,243 INFO  L132   encePairwiseOnDemand]: 101/107 looper letters, 9 selfloop transitions, 1 changer transitions 21/169 dead transitions.
[2020-10-11 18:27:05,243 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 169 transitions, 1019 flow
[2020-10-11 18:27:05,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 18:27:05,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-11 18:27:05,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions.
[2020-10-11 18:27:05,244 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9092122830440588
[2020-10-11 18:27:05,245 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 681 transitions.
[2020-10-11 18:27:05,245 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions.
[2020-10-11 18:27:05,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:27:05,245 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions.
[2020-10-11 18:27:05,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-11 18:27:05,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-11 18:27:05,246 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-11 18:27:05,246 INFO  L185             Difference]: Start difference. First operand has 178 places, 164 transitions, 973 flow. Second operand 7 states and 681 transitions.
[2020-10-11 18:27:05,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 169 transitions, 1019 flow
[2020-10-11 18:27:06,254 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 169 transitions, 898 flow, removed 7 selfloop flow, removed 17 redundant places.
[2020-10-11 18:27:06,256 INFO  L241             Difference]: Finished difference. Result has 170 places, 148 transitions, 767 flow
[2020-10-11 18:27:06,256 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=767, PETRI_PLACES=170, PETRI_TRANSITIONS=148}
[2020-10-11 18:27:06,256 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 56 predicate places.
[2020-10-11 18:27:06,256 INFO  L481      AbstractCegarLoop]: Abstraction has has 170 places, 148 transitions, 767 flow
[2020-10-11 18:27:06,256 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 18:27:06,256 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:27:06,257 INFO  L255   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]
[2020-10-11 18:27:06,257 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-10-11 18:27:06,257 INFO  L429      AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:27:06,257 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:27:06,257 INFO  L82        PathProgramCache]: Analyzing trace with hash -1451411378, now seen corresponding path program 2 times
[2020-10-11 18:27:06,258 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:27:06,258 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311274319]
[2020-10-11 18:27:06,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:27:06,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 18:27:06,295 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 18:27:06,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 18:27:06,332 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 18:27:06,376 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 18:27:06,377 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 18:27:06,377 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2020-10-11 18:27:06,424 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,425 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,426 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,426 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,426 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,427 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,427 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,427 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,427 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,427 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,427 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,428 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,428 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,428 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,428 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,428 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,428 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,429 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,429 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,429 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,429 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,429 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,429 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,430 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,431 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,431 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,431 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,431 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,431 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,431 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,432 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,432 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,432 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,432 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,432 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,432 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,433 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,433 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,433 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,433 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,433 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,433 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,434 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,434 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,434 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,434 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,434 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,434 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,435 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,435 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,435 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,435 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,435 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,435 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,436 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,436 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,436 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,436 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,436 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:27:06,436 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:06,551 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:27:06 BasicIcfg
[2020-10-11 18:27:06,551 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 18:27:06,554 INFO  L168              Benchmark]: Toolchain (without parser) took 43070.78 ms. Allocated memory was 251.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 207.0 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 287.0 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,554 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,555 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 769.11 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 207.0 MB in the beginning and 266.5 MB in the end (delta: -59.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,556 INFO  L168              Benchmark]: Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 315.6 MB. Free memory was 266.5 MB in the beginning and 264.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,556 INFO  L168              Benchmark]: Boogie Preprocessor took 39.26 ms. Allocated memory is still 315.6 MB. Free memory was 264.0 MB in the beginning and 261.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,557 INFO  L168              Benchmark]: RCFGBuilder took 1987.92 ms. Allocated memory was 315.6 MB in the beginning and 358.6 MB in the end (delta: 43.0 MB). Free memory was 261.5 MB in the beginning and 210.5 MB in the end (delta: 50.9 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,558 INFO  L168              Benchmark]: TraceAbstraction took 40201.57 ms. Allocated memory was 358.6 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 210.5 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 183.5 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:06,562 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.25 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 769.11 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 207.0 MB in the beginning and 266.5 MB in the end (delta: -59.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 315.6 MB. Free memory was 266.5 MB in the beginning and 264.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 39.26 ms. Allocated memory is still 315.6 MB. Free memory was 264.0 MB in the beginning and 261.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1987.92 ms. Allocated memory was 315.6 MB in the beginning and 358.6 MB in the end (delta: 43.0 MB). Free memory was 261.5 MB in the beginning and 210.5 MB in the end (delta: 50.9 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 40201.57 ms. Allocated memory was 358.6 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 210.5 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 183.5 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L701]               0  int __unbuffered_p3_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0]
[L703]               0  int a = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0]
[L704]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0]
[L705]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L707]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L709]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L711]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L712]               0  _Bool z$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0]
[L713]               0  int z$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0]
[L714]               0  _Bool z$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0]
[L715]               0  _Bool z$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0]
[L716]               0  _Bool z$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0]
[L717]               0  _Bool z$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0]
[L718]               0  _Bool z$r_buff0_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0]
[L719]               0  _Bool z$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0]
[L720]               0  _Bool z$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0]
[L721]               0  _Bool z$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0]
[L722]               0  _Bool z$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0]
[L723]               0  _Bool z$r_buff1_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0]
[L724]               0  _Bool z$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0]
[L725]               0  int *z$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}]
[L726]               0  int z$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0]
[L727]               0  _Bool z$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0]
[L728]               0  int z$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0]
[L729]               0  _Bool z$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L730]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L731]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L823]               0  pthread_t t1533;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L824]  FCALL, FORK  0  pthread_create(&t1533, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L825]               0  pthread_t t1534;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L826]  FCALL, FORK  0  pthread_create(&t1534, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L827]               0  pthread_t t1535;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L828]  FCALL, FORK  0  pthread_create(&t1535, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L829]               0  pthread_t t1536;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L830]  FCALL, FORK  0  pthread_create(&t1536, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L785]               4  z$w_buff1 = z$w_buff0
[L786]               4  z$w_buff0 = 2
[L787]               4  z$w_buff1_used = z$w_buff0_used
[L788]               4  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    4  !expression
[L7]                 4  __VERIFIER_error()
[L790]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L791]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L792]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L793]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L794]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L795]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L798]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L735]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L738]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L750]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L753]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L765]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L743]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L758]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L768]               3  z = 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L771]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L772]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L772]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L773]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L773]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L774]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L774]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L775]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L775]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L801]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L801]  EXPR         4  z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z
[L801]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L801]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L802]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L802]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L803]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L803]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L804]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L804]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L805]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L805]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L778]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L808]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L832]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L836]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L836]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L837]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L837]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L838]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L838]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L839]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L839]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L840]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L840]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L843]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L844]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L845]               0  z$flush_delayed = weak$$choice2
[L846]               0  z$mem_tmp = z
[L847]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L847]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L848]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L848]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L849]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L849]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L850]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L850]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L850]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L850]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L851]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L851]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L852]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L852]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L852]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L852]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L852]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L852]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L853]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L853]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L853]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L853]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L853]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L853]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L854]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0)
[L855]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L855]               0  z = z$flush_delayed ? z$mem_tmp : z
[L856]               0  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L7]    COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L7]                 0  __VERIFIER_error()
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 39.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 524 SDtfs, 1210 SDslu, 3515 SDs, 0 SdLazy, 3443 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1375occurred in iteration=20, 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.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1633 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 584667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...