/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_power.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 18:26:04,751 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 18:26:04,754 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 18:26:04,796 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 18:26:04,796 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 18:26:04,805 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 18:26:04,808 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 18:26:04,811 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 18:26:04,814 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 18:26:04,817 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 18:26:04,818 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 18:26:04,820 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 18:26:04,820 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 18:26:04,823 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 18:26:04,826 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 18:26:04,827 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 18:26:04,829 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 18:26:04,830 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 18:26:04,831 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 18:26:04,839 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 18:26:04,841 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 18:26:04,842 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 18:26:04,843 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 18:26:04,844 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 18:26:04,856 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 18:26:04,857 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 18:26:04,857 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 18:26:04,862 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 18:26:04,862 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 18:26:04,863 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 18:26:04,863 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 18:26:04,864 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 18:26:04,864 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 18:26:04,869 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 18:26:04,870 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 18:26:04,871 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 18:26:04,871 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 18:26:04,871 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 18:26:04,872 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 18:26:04,875 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 18:26:04,876 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 18:26:04,877 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:04,914 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 18:26:04,914 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 18:26:04,916 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 18:26:04,916 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 18:26:04,916 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 18:26:04,917 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 18:26:04,917 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 18:26:04,917 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 18:26:04,917 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 18:26:04,917 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 18:26:04,917 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 18:26:04,918 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 18:26:04,918 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 18:26:04,918 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 18:26:04,918 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 18:26:04,918 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 18:26:04,919 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 18:26:04,919 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 18:26:04,919 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 18:26:04,919 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 18:26:04,919 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 18:26:04,920 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 18:26:04,920 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 18:26:04,920 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 18:26:04,920 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 18:26:04,920 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 18:26:04,921 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 18:26:04,921 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2020-10-11 18:26:04,921 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-11 18:26:04,921 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 18:26:05,199 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 18:26:05,212 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 18:26:05,216 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 18:26:05,218 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 18:26:05,220 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 18:26:05,221 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i
[2020-10-11 18:26:05,281 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd6467b/4fcee1f17be2463e84b648e65e50ff64/FLAG95479c366
[2020-10-11 18:26:05,846 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 18:26:05,846 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i
[2020-10-11 18:26:05,864 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd6467b/4fcee1f17be2463e84b648e65e50ff64/FLAG95479c366
[2020-10-11 18:26:06,121 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd6467b/4fcee1f17be2463e84b648e65e50ff64
[2020-10-11 18:26:06,132 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 18:26:06,134 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 18:26:06,135 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 18:26:06,135 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 18:26:06,139 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 18:26:06,140 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:06" (1/1) ...
[2020-10-11 18:26:06,142 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f84e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:06, skipping insertion in model container
[2020-10-11 18:26:06,143 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:06" (1/1) ...
[2020-10-11 18:26:06,151 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 18:26:06,200 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 18:26:06,659 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 18:26:06,677 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 18:26:06,781 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 18:26:06,853 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 18:26:06,853 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:06 WrapperNode
[2020-10-11 18:26:06,854 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 18:26:06,854 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 18:26:06,855 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 18:26:06,855 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 18:26:06,864 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:06" (1/1) ...
[2020-10-11 18:26:06,883 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:06" (1/1) ...
[2020-10-11 18:26:06,922 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 18:26:06,922 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 18:26:06,923 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 18:26:06,923 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 18:26:06,933 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:06" (1/1) ...
[2020-10-11 18:26:06,937 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:06" (1/1) ...
[2020-10-11 18:26:06,945 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:06" (1/1) ...
[2020-10-11 18:26:06,946 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:06" (1/1) ...
[2020-10-11 18:26:06,966 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:06" (1/1) ...
[2020-10-11 18:26:06,978 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:06" (1/1) ...
[2020-10-11 18:26:06,983 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:06" (1/1) ...
[2020-10-11 18:26:06,989 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 18:26:06,991 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 18:26:06,991 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 18:26:06,991 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 18:26:06,992 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:06" (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:07,071 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 18:26:07,072 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 18:26:07,072 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 18:26:07,072 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 18:26:07,072 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 18:26:07,073 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 18:26:07,073 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 18:26:07,074 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 18:26:07,074 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 18:26:07,075 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 18:26:07,075 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 18:26:07,075 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 18:26:07,075 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 18:26:07,075 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 18:26:07,075 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 18:26:07,078 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:08,909 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 18:26:08,909 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 18:26:08,911 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:08 BoogieIcfgContainer
[2020-10-11 18:26:08,911 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 18:26:08,913 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 18:26:08,913 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 18:26:08,916 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 18:26:08,916 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:26:06" (1/3) ...
[2020-10-11 18:26:08,917 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75be1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:08, skipping insertion in model container
[2020-10-11 18:26:08,918 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:06" (2/3) ...
[2020-10-11 18:26:08,918 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75be1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:08, skipping insertion in model container
[2020-10-11 18:26:08,918 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:08" (3/3) ...
[2020-10-11 18:26:08,920 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix057_power.opt.i
[2020-10-11 18:26:08,932 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 18:26:08,939 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 18:26:08,940 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 18:26:08,972 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,972 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,972 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,972 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,973 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,973 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,974 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,974 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,974 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,974 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,974 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,975 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,975 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,975 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,975 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,976 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,976 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,976 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,976 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,976 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,977 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,977 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,977 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,977 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,978 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,978 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,979 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,979 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,979 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,979 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,979 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:08,980 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,980 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:08,980 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,980 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,981 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,981 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,981 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,981 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,981 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,982 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,982 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,986 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,986 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,987 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,987 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,987 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,987 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,988 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,988 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,988 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,988 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,990 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,990 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,991 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,991 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:08,991 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,991 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,991 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,992 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,992 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,992 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,992 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,992 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,996 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,996 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,997 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,997 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,998 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,998 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,998 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:08,998 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:26:09,015 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 18:26:09,037 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 18:26:09,037 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-11 18:26:09,038 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 18:26:09,038 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 18:26:09,038 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 18:26:09,038 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 18:26:09,038 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 18:26:09,038 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 18:26:09,054 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow
[2020-10-11 18:26:09,104 INFO  L129       PetriNetUnfolder]: 2/103 cut-off events.
[2020-10-11 18:26:09,104 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:09,110 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:09,110 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow
[2020-10-11 18:26:09,117 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow
[2020-10-11 18:26:09,136 INFO  L129       PetriNetUnfolder]: 0/70 cut-off events.
[2020-10-11 18:26:09,136 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:09,137 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:09,142 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:09,142 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:09,150 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:09,150 INFO  L82        PathProgramCache]: Analyzing trace with hash 1614687930, now seen corresponding path program 1 times
[2020-10-11 18:26:09,161 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:09,161 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19588505]
[2020-10-11 18:26:09,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:09,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:09,588 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:09,589 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19588505]
[2020-10-11 18:26:09,591 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:09,594 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 18:26:09,595 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534658058]
[2020-10-11 18:26:09,607 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 18:26:09,608 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:09,631 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 18:26:09,634 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 18:26:09,794 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 107
[2020-10-11 18:26:09,797 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states.
[2020-10-11 18:26:09,797 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:09,797 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 107
[2020-10-11 18:26:09,799 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:09,833 INFO  L129       PetriNetUnfolder]: 0/100 cut-off events.
[2020-10-11 18:26:09,834 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:09,834 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:09,836 INFO  L132   encePairwiseOnDemand]: 102/107 looper letters, 0 selfloop transitions, 2 changer transitions 13/100 dead transitions.
[2020-10-11 18:26:09,836 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 100 transitions, 216 flow
[2020-10-11 18:26:09,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 18:26:09,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-11 18:26:09,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions.
[2020-10-11 18:26:09,853 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9750778816199377
[2020-10-11 18:26:09,854 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 313 transitions.
[2020-10-11 18:26:09,854 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions.
[2020-10-11 18:26:09,856 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:09,859 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions.
[2020-10-11 18:26:09,863 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-11 18:26:09,869 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-11 18:26:09,870 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-11 18:26:09,872 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:09,873 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 100 transitions, 216 flow
[2020-10-11 18:26:09,878 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:09,881 INFO  L241             Difference]: Finished difference. Result has 111 places, 87 transitions, 186 flow
[2020-10-11 18:26:09,885 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:09,886 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places.
[2020-10-11 18:26:09,886 INFO  L481      AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 186 flow
[2020-10-11 18:26:09,886 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 18:26:09,886 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:09,886 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:09,887 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 18:26:09,887 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:09,887 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:09,887 INFO  L82        PathProgramCache]: Analyzing trace with hash 343442451, now seen corresponding path program 1 times
[2020-10-11 18:26:09,888 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:09,888 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892765346]
[2020-10-11 18:26:09,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:10,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:10,143 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:10,144 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892765346]
[2020-10-11 18:26:10,144 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:10,144 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:10,144 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41117185]
[2020-10-11 18:26:10,146 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:10,147 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:10,147 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:10,147 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:10,267 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:10,268 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 87 transitions, 186 flow. Second operand 6 states.
[2020-10-11 18:26:10,268 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:10,268 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:10,269 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:10,424 INFO  L129       PetriNetUnfolder]: 24/163 cut-off events.
[2020-10-11 18:26:10,424 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:26:10,426 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:10,427 INFO  L132   encePairwiseOnDemand]: 100/107 looper letters, 8 selfloop transitions, 3 changer transitions 19/108 dead transitions.
[2020-10-11 18:26:10,427 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 288 flow
[2020-10-11 18:26:10,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:10,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:10,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions.
[2020-10-11 18:26:10,434 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9304257528556594
[2020-10-11 18:26:10,434 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 896 transitions.
[2020-10-11 18:26:10,434 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions.
[2020-10-11 18:26:10,435 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:10,436 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions.
[2020-10-11 18:26:10,439 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:10,443 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:10,443 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:10,443 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:10,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 288 flow
[2020-10-11 18:26:10,445 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:10,449 INFO  L241             Difference]: Finished difference. Result has 111 places, 89 transitions, 225 flow
[2020-10-11 18:26:10,449 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:10,450 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places.
[2020-10-11 18:26:10,450 INFO  L481      AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 225 flow
[2020-10-11 18:26:10,450 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:10,450 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:10,451 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:10,451 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 18:26:10,451 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:10,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:10,452 INFO  L82        PathProgramCache]: Analyzing trace with hash -655605036, now seen corresponding path program 1 times
[2020-10-11 18:26:10,452 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:10,452 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313255872]
[2020-10-11 18:26:10,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:10,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:10,733 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:10,734 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313255872]
[2020-10-11 18:26:10,734 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:10,734 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-11 18:26:10,734 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403394407]
[2020-10-11 18:26:10,735 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 18:26:10,735 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:10,735 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 18:26:10,736 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-11 18:26:11,204 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107
[2020-10-11 18:26:11,206 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 225 flow. Second operand 9 states.
[2020-10-11 18:26:11,206 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:11,206 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107
[2020-10-11 18:26:11,206 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:11,626 INFO  L129       PetriNetUnfolder]: 292/669 cut-off events.
[2020-10-11 18:26:11,627 INFO  L130       PetriNetUnfolder]: For 595/597 co-relation queries the response was YES.
[2020-10-11 18:26:11,634 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1615 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 3684 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:11,639 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 12 selfloop transitions, 9 changer transitions 34/130 dead transitions.
[2020-10-11 18:26:11,639 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 445 flow
[2020-10-11 18:26:11,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:11,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:11,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1318 transitions.
[2020-10-11 18:26:11,643 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8798397863818425
[2020-10-11 18:26:11,644 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1318 transitions.
[2020-10-11 18:26:11,644 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1318 transitions.
[2020-10-11 18:26:11,645 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:11,645 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1318 transitions.
[2020-10-11 18:26:11,648 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:11,650 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:11,650 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:11,651 INFO  L185             Difference]: Start difference. First operand has 111 places, 89 transitions, 225 flow. Second operand 14 states and 1318 transitions.
[2020-10-11 18:26:11,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 445 flow
[2020-10-11 18:26:11,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 130 transitions, 424 flow, removed 9 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:11,658 INFO  L241             Difference]: Finished difference. Result has 125 places, 95 transitions, 300 flow
[2020-10-11 18:26:11,659 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=300, PETRI_PLACES=125, PETRI_TRANSITIONS=95}
[2020-10-11 18:26:11,659 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places.
[2020-10-11 18:26:11,659 INFO  L481      AbstractCegarLoop]: Abstraction has has 125 places, 95 transitions, 300 flow
[2020-10-11 18:26:11,659 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 18:26:11,660 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:11,660 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:11,660 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 18:26:11,660 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:11,661 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:11,661 INFO  L82        PathProgramCache]: Analyzing trace with hash -44956850, now seen corresponding path program 1 times
[2020-10-11 18:26:11,661 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:11,661 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222255469]
[2020-10-11 18:26:11,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:11,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:11,841 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:11,842 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222255469]
[2020-10-11 18:26:11,842 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:11,842 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:11,842 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306710017]
[2020-10-11 18:26:11,843 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:11,844 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:11,844 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:11,845 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:12,034 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:12,034 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 95 transitions, 300 flow. Second operand 6 states.
[2020-10-11 18:26:12,035 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:12,035 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:12,035 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:12,448 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, 201#(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: 161#(and (<= 1 ~main$tmp_guard1~0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~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|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(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: 167#(and (<= 1 ~main$tmp_guard1~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|))), P2Thread1of1ForFork0InUse, Black: 151#(= ~z~0 0), P1Thread1of1ForFork3InUse, Black: 169#(and (<= 1 ~main$tmp_guard1~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|)) (= ~z$w_buff0_used~0 0) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork1InUse, Black: 171#(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: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 173#(and (<= 1 ~main$tmp_guard1~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))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0))])
[2020-10-11 18:26:12,448 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:12,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:12,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:12,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2020-10-11 18:26:12,461 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, 201#(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: 161#(and (<= 1 ~main$tmp_guard1~0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~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|)) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 165#(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: 167#(and (<= 1 ~main$tmp_guard1~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|))), P2Thread1of1ForFork0InUse, Black: 151#(= ~z~0 0), Black: 169#(and (<= 1 ~main$tmp_guard1~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|)) (= ~z$w_buff0_used~0 0) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0)) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork3InUse, Black: 153#(and (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork1InUse, Black: 171#(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: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 173#(and (<= 1 ~main$tmp_guard1~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))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (= ~z~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0))])
[2020-10-11 18:26:12,461 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:12,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:12,462 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:12,462 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is not cut-off event
[2020-10-11 18:26:12,464 INFO  L129       PetriNetUnfolder]: 358/921 cut-off events.
[2020-10-11 18:26:12,464 INFO  L130       PetriNetUnfolder]: For 2808/2906 co-relation queries the response was YES.
[2020-10-11 18:26:12,473 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 921 events. 358/921 cut-off events. For 2808/2906 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6259 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:12,482 INFO  L132   encePairwiseOnDemand]: 100/107 looper letters, 17 selfloop transitions, 15 changer transitions 0/117 dead transitions.
[2020-10-11 18:26:12,482 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 451 flow
[2020-10-11 18:26:12,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:12,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:12,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions.
[2020-10-11 18:26:12,486 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9304257528556594
[2020-10-11 18:26:12,486 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 896 transitions.
[2020-10-11 18:26:12,486 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions.
[2020-10-11 18:26:12,487 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:12,487 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions.
[2020-10-11 18:26:12,489 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:12,490 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:12,491 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:12,491 INFO  L185             Difference]: Start difference. First operand has 125 places, 95 transitions, 300 flow. Second operand 9 states and 896 transitions.
[2020-10-11 18:26:12,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 451 flow
[2020-10-11 18:26:12,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 435 flow, removed 7 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:12,504 INFO  L241             Difference]: Finished difference. Result has 125 places, 109 transitions, 433 flow
[2020-10-11 18:26:12,504 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:12,504 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places.
[2020-10-11 18:26:12,505 INFO  L481      AbstractCegarLoop]: Abstraction has has 125 places, 109 transitions, 433 flow
[2020-10-11 18:26:12,505 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:12,505 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:12,505 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:12,506 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 18:26:12,506 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:12,506 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:12,506 INFO  L82        PathProgramCache]: Analyzing trace with hash -2107477394, now seen corresponding path program 1 times
[2020-10-11 18:26:12,506 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:12,507 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443420195]
[2020-10-11 18:26:12,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:12,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:12,910 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:12,910 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443420195]
[2020-10-11 18:26:12,911 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:12,911 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:12,911 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546073135]
[2020-10-11 18:26:12,913 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:12,913 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:12,914 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:12,914 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:13,640 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:13,641 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 109 transitions, 433 flow. Second operand 10 states.
[2020-10-11 18:26:13,641 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:13,641 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:13,642 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:14,286 INFO  L129       PetriNetUnfolder]: 740/1704 cut-off events.
[2020-10-11 18:26:14,286 INFO  L130       PetriNetUnfolder]: For 6793/6914 co-relation queries the response was YES.
[2020-10-11 18:26:14,310 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6418 conditions, 1704 events. 740/1704 cut-off events. For 6793/6914 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12785 event pairs, 294 based on Foata normal form. 35/1650 useless extension candidates. Maximal degree in co-relation 6349. Up to 559 conditions per place. 
[2020-10-11 18:26:14,322 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 13 selfloop transitions, 10 changer transitions 44/143 dead transitions.
[2020-10-11 18:26:14,323 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 143 transitions, 819 flow
[2020-10-11 18:26:14,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 18:26:14,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-10-11 18:26:14,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1113 transitions.
[2020-10-11 18:26:14,327 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.866822429906542
[2020-10-11 18:26:14,327 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1113 transitions.
[2020-10-11 18:26:14,327 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1113 transitions.
[2020-10-11 18:26:14,328 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:14,328 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1113 transitions.
[2020-10-11 18:26:14,331 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 13 states.
[2020-10-11 18:26:14,333 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states.
[2020-10-11 18:26:14,333 INFO  L81            ComplementDD]: Finished complementDD. Result 13 states.
[2020-10-11 18:26:14,334 INFO  L185             Difference]: Start difference. First operand has 125 places, 109 transitions, 433 flow. Second operand 12 states and 1113 transitions.
[2020-10-11 18:26:14,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 143 transitions, 819 flow
[2020-10-11 18:26:14,345 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 143 transitions, 807 flow, removed 6 selfloop flow, removed 0 redundant places.
[2020-10-11 18:26:14,348 INFO  L241             Difference]: Finished difference. Result has 143 places, 98 transitions, 395 flow
[2020-10-11 18:26:14,348 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=143, PETRI_TRANSITIONS=98}
[2020-10-11 18:26:14,349 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 29 predicate places.
[2020-10-11 18:26:14,349 INFO  L481      AbstractCegarLoop]: Abstraction has has 143 places, 98 transitions, 395 flow
[2020-10-11 18:26:14,349 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:14,349 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:14,349 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:14,350 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 18:26:14,350 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:14,350 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:14,350 INFO  L82        PathProgramCache]: Analyzing trace with hash 588858555, now seen corresponding path program 1 times
[2020-10-11 18:26:14,350 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:14,351 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659576176]
[2020-10-11 18:26:14,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:14,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:14,586 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:14,587 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659576176]
[2020-10-11 18:26:14,587 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:14,587 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:14,588 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638887622]
[2020-10-11 18:26:14,588 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:14,589 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:14,589 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:14,594 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:15,203 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:15,204 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 98 transitions, 395 flow. Second operand 10 states.
[2020-10-11 18:26:15,204 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:15,204 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:15,204 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:15,815 INFO  L129       PetriNetUnfolder]: 371/952 cut-off events.
[2020-10-11 18:26:15,815 INFO  L130       PetriNetUnfolder]: For 7269/7304 co-relation queries the response was YES.
[2020-10-11 18:26:15,825 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 952 events. 371/952 cut-off events. For 7269/7304 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6089 event pairs, 45 based on Foata normal form. 29/933 useless extension candidates. Maximal degree in co-relation 4152. Up to 324 conditions per place. 
[2020-10-11 18:26:15,833 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 23 selfloop transitions, 8 changer transitions 25/132 dead transitions.
[2020-10-11 18:26:15,834 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 132 transitions, 813 flow
[2020-10-11 18:26:15,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:15,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:15,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1388 transitions.
[2020-10-11 18:26:15,839 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.864797507788162
[2020-10-11 18:26:15,839 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1388 transitions.
[2020-10-11 18:26:15,839 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1388 transitions.
[2020-10-11 18:26:15,840 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:15,840 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1388 transitions.
[2020-10-11 18:26:15,843 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:15,846 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:15,846 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:15,847 INFO  L185             Difference]: Start difference. First operand has 143 places, 98 transitions, 395 flow. Second operand 15 states and 1388 transitions.
[2020-10-11 18:26:15,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 132 transitions, 813 flow
[2020-10-11 18:26:15,855 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 132 transitions, 735 flow, removed 31 selfloop flow, removed 11 redundant places.
[2020-10-11 18:26:15,858 INFO  L241             Difference]: Finished difference. Result has 144 places, 100 transitions, 412 flow
[2020-10-11 18:26:15,858 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=412, PETRI_PLACES=144, PETRI_TRANSITIONS=100}
[2020-10-11 18:26:15,858 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 30 predicate places.
[2020-10-11 18:26:15,858 INFO  L481      AbstractCegarLoop]: Abstraction has has 144 places, 100 transitions, 412 flow
[2020-10-11 18:26:15,859 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:15,859 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:15,859 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:15,859 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 18:26:15,859 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:15,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:15,860 INFO  L82        PathProgramCache]: Analyzing trace with hash -1880213998, now seen corresponding path program 1 times
[2020-10-11 18:26:15,860 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:15,860 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514244004]
[2020-10-11 18:26:15,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:15,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:16,085 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:16,085 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514244004]
[2020-10-11 18:26:16,086 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:16,086 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-11 18:26:16,086 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184591119]
[2020-10-11 18:26:16,086 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-11 18:26:16,087 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:16,087 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-11 18:26:16,087 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2020-10-11 18:26:17,542 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2020-10-11 18:26:17,543 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 100 transitions, 412 flow. Second operand 12 states.
[2020-10-11 18:26:17,544 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:17,544 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2020-10-11 18:26:17,544 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:18,059 INFO  L129       PetriNetUnfolder]: 307/729 cut-off events.
[2020-10-11 18:26:18,059 INFO  L130       PetriNetUnfolder]: For 6913/6954 co-relation queries the response was YES.
[2020-10-11 18:26:18,068 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 729 events. 307/729 cut-off events. For 6913/6954 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4113 event pairs, 67 based on Foata normal form. 19/698 useless extension candidates. Maximal degree in co-relation 3786. Up to 317 conditions per place. 
[2020-10-11 18:26:18,076 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 24 selfloop transitions, 11 changer transitions 13/123 dead transitions.
[2020-10-11 18:26:18,077 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 123 transitions, 784 flow
[2020-10-11 18:26:18,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:18,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:18,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1186 transitions.
[2020-10-11 18:26:18,082 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8526240115025162
[2020-10-11 18:26:18,082 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1186 transitions.
[2020-10-11 18:26:18,082 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1186 transitions.
[2020-10-11 18:26:18,083 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:18,083 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1186 transitions.
[2020-10-11 18:26:18,086 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:18,088 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:18,089 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:18,089 INFO  L185             Difference]: Start difference. First operand has 144 places, 100 transitions, 412 flow. Second operand 13 states and 1186 transitions.
[2020-10-11 18:26:18,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 123 transitions, 784 flow
[2020-10-11 18:26:18,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 123 transitions, 671 flow, removed 50 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:18,105 INFO  L241             Difference]: Finished difference. Result has 142 places, 103 transitions, 433 flow
[2020-10-11 18:26:18,105 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=372, 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=13, PETRI_FLOW=433, PETRI_PLACES=142, PETRI_TRANSITIONS=103}
[2020-10-11 18:26:18,106 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 28 predicate places.
[2020-10-11 18:26:18,106 INFO  L481      AbstractCegarLoop]: Abstraction has has 142 places, 103 transitions, 433 flow
[2020-10-11 18:26:18,106 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-11 18:26:18,106 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:18,106 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:18,106 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 18:26:18,107 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:18,107 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:18,108 INFO  L82        PathProgramCache]: Analyzing trace with hash 2043580946, now seen corresponding path program 2 times
[2020-10-11 18:26:18,108 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:18,108 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141754154]
[2020-10-11 18:26:18,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:18,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:18,394 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:18,394 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141754154]
[2020-10-11 18:26:18,394 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:18,395 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-10-11 18:26:18,395 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386800074]
[2020-10-11 18:26:18,395 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-11 18:26:18,396 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:18,396 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-11 18:26:18,396 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2020-10-11 18:26:20,033 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107
[2020-10-11 18:26:20,034 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 103 transitions, 433 flow. Second operand 13 states.
[2020-10-11 18:26:20,034 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:20,034 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107
[2020-10-11 18:26:20,034 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:20,474 INFO  L129       PetriNetUnfolder]: 269/706 cut-off events.
[2020-10-11 18:26:20,474 INFO  L130       PetriNetUnfolder]: For 4748/4853 co-relation queries the response was YES.
[2020-10-11 18:26:20,483 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 706 events. 269/706 cut-off events. For 4748/4853 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4065 event pairs, 68 based on Foata normal form. 26/686 useless extension candidates. Maximal degree in co-relation 3176. Up to 297 conditions per place. 
[2020-10-11 18:26:20,490 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 19 selfloop transitions, 11 changer transitions 13/117 dead transitions.
[2020-10-11 18:26:20,490 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 117 transitions, 676 flow
[2020-10-11 18:26:20,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:20,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:20,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1255 transitions.
[2020-10-11 18:26:20,496 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8377837116154874
[2020-10-11 18:26:20,496 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1255 transitions.
[2020-10-11 18:26:20,496 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1255 transitions.
[2020-10-11 18:26:20,497 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:20,497 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1255 transitions.
[2020-10-11 18:26:20,500 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:20,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:20,503 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:20,503 INFO  L185             Difference]: Start difference. First operand has 142 places, 103 transitions, 433 flow. Second operand 14 states and 1255 transitions.
[2020-10-11 18:26:20,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 117 transitions, 676 flow
[2020-10-11 18:26:20,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 117 transitions, 615 flow, removed 23 selfloop flow, removed 10 redundant places.
[2020-10-11 18:26:20,512 INFO  L241             Difference]: Finished difference. Result has 146 places, 103 transitions, 438 flow
[2020-10-11 18:26:20,513 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=438, PETRI_PLACES=146, PETRI_TRANSITIONS=103}
[2020-10-11 18:26:20,514 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 32 predicate places.
[2020-10-11 18:26:20,514 INFO  L481      AbstractCegarLoop]: Abstraction has has 146 places, 103 transitions, 438 flow
[2020-10-11 18:26:20,515 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-11 18:26:20,515 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:20,515 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:20,515 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 18:26:20,515 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:20,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:20,516 INFO  L82        PathProgramCache]: Analyzing trace with hash 982457267, now seen corresponding path program 1 times
[2020-10-11 18:26:20,516 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:20,518 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146722157]
[2020-10-11 18:26:20,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:20,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:20,642 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:20,642 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146722157]
[2020-10-11 18:26:20,642 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:20,643 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:20,643 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666466063]
[2020-10-11 18:26:20,643 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:20,643 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:20,644 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:20,644 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:20,813 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:20,813 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 103 transitions, 438 flow. Second operand 6 states.
[2020-10-11 18:26:20,813 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:20,813 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:20,813 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:21,053 INFO  L129       PetriNetUnfolder]: 242/853 cut-off events.
[2020-10-11 18:26:21,053 INFO  L130       PetriNetUnfolder]: For 5546/5707 co-relation queries the response was YES.
[2020-10-11 18:26:21,063 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3493 conditions, 853 events. 242/853 cut-off events. For 5546/5707 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6047 event pairs, 75 based on Foata normal form. 22/829 useless extension candidates. Maximal degree in co-relation 3408. Up to 141 conditions per place. 
[2020-10-11 18:26:21,070 INFO  L132   encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 3 changer transitions 10/117 dead transitions.
[2020-10-11 18:26:21,071 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 117 transitions, 642 flow
[2020-10-11 18:26:21,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:21,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:21,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions.
[2020-10-11 18:26:21,074 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9241952232606438
[2020-10-11 18:26:21,074 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 890 transitions.
[2020-10-11 18:26:21,074 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions.
[2020-10-11 18:26:21,075 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:21,075 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions.
[2020-10-11 18:26:21,077 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:21,079 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:21,079 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:21,079 INFO  L185             Difference]: Start difference. First operand has 146 places, 103 transitions, 438 flow. Second operand 9 states and 890 transitions.
[2020-10-11 18:26:21,080 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 117 transitions, 642 flow
[2020-10-11 18:26:21,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 117 transitions, 551 flow, removed 37 selfloop flow, removed 15 redundant places.
[2020-10-11 18:26:21,093 INFO  L241             Difference]: Finished difference. Result has 140 places, 103 transitions, 418 flow
[2020-10-11 18:26:21,093 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=140, PETRI_TRANSITIONS=103}
[2020-10-11 18:26:21,094 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places.
[2020-10-11 18:26:21,094 INFO  L481      AbstractCegarLoop]: Abstraction has has 140 places, 103 transitions, 418 flow
[2020-10-11 18:26:21,094 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:21,094 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:21,094 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:21,094 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 18:26:21,095 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:21,095 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:21,095 INFO  L82        PathProgramCache]: Analyzing trace with hash 1328640541, now seen corresponding path program 1 times
[2020-10-11 18:26:21,095 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:21,095 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591478824]
[2020-10-11 18:26:21,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:21,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:21,359 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:21,360 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591478824]
[2020-10-11 18:26:21,360 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:21,360 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:21,361 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886551506]
[2020-10-11 18:26:21,362 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:21,362 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:21,362 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:21,362 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:22,099 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:22,100 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 103 transitions, 418 flow. Second operand 10 states.
[2020-10-11 18:26:22,100 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:22,101 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:22,101 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:22,498 INFO  L129       PetriNetUnfolder]: 356/951 cut-off events.
[2020-10-11 18:26:22,498 INFO  L130       PetriNetUnfolder]: For 6508/6680 co-relation queries the response was YES.
[2020-10-11 18:26:22,505 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 951 events. 356/951 cut-off events. For 6508/6680 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6296 event pairs, 121 based on Foata normal form. 39/938 useless extension candidates. Maximal degree in co-relation 4309. Up to 376 conditions per place. 
[2020-10-11 18:26:22,510 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 20 selfloop transitions, 13 changer transitions 10/119 dead transitions.
[2020-10-11 18:26:22,511 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 119 transitions, 660 flow
[2020-10-11 18:26:22,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:22,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:22,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 836 transitions.
[2020-10-11 18:26:22,514 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8681204569055037
[2020-10-11 18:26:22,514 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 836 transitions.
[2020-10-11 18:26:22,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 836 transitions.
[2020-10-11 18:26:22,515 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:22,515 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 836 transitions.
[2020-10-11 18:26:22,516 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:22,518 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:22,519 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:22,519 INFO  L185             Difference]: Start difference. First operand has 140 places, 103 transitions, 418 flow. Second operand 9 states and 836 transitions.
[2020-10-11 18:26:22,519 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 119 transitions, 660 flow
[2020-10-11 18:26:22,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 119 transitions, 631 flow, removed 13 selfloop flow, removed 7 redundant places.
[2020-10-11 18:26:22,530 INFO  L241             Difference]: Finished difference. Result has 140 places, 108 transitions, 487 flow
[2020-10-11 18:26:22,531 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=140, PETRI_TRANSITIONS=108}
[2020-10-11 18:26:22,531 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places.
[2020-10-11 18:26:22,531 INFO  L481      AbstractCegarLoop]: Abstraction has has 140 places, 108 transitions, 487 flow
[2020-10-11 18:26:22,532 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:22,532 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:22,532 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:22,532 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 18:26:22,532 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:22,532 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:22,533 INFO  L82        PathProgramCache]: Analyzing trace with hash -1774608237, now seen corresponding path program 2 times
[2020-10-11 18:26:22,533 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:22,533 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042338630]
[2020-10-11 18:26:22,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:22,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:22,734 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:22,734 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042338630]
[2020-10-11 18:26:22,734 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:22,735 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:22,735 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289405042]
[2020-10-11 18:26:22,735 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:22,735 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:22,736 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:22,736 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:23,676 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:23,676 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 108 transitions, 487 flow. Second operand 10 states.
[2020-10-11 18:26:23,677 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:23,677 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:23,677 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:24,212 INFO  L129       PetriNetUnfolder]: 359/978 cut-off events.
[2020-10-11 18:26:24,212 INFO  L130       PetriNetUnfolder]: For 6545/6829 co-relation queries the response was YES.
[2020-10-11 18:26:24,224 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 978 events. 359/978 cut-off events. For 6545/6829 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6654 event pairs, 86 based on Foata normal form. 47/975 useless extension candidates. Maximal degree in co-relation 4570. Up to 380 conditions per place. 
[2020-10-11 18:26:24,235 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 21 selfloop transitions, 14 changer transitions 19/130 dead transitions.
[2020-10-11 18:26:24,235 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 130 transitions, 851 flow
[2020-10-11 18:26:24,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 18:26:24,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-10-11 18:26:24,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1113 transitions.
[2020-10-11 18:26:24,240 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.866822429906542
[2020-10-11 18:26:24,240 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1113 transitions.
[2020-10-11 18:26:24,240 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1113 transitions.
[2020-10-11 18:26:24,241 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:24,241 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1113 transitions.
[2020-10-11 18:26:24,243 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 13 states.
[2020-10-11 18:26:24,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states.
[2020-10-11 18:26:24,246 INFO  L81            ComplementDD]: Finished complementDD. Result 13 states.
[2020-10-11 18:26:24,247 INFO  L185             Difference]: Start difference. First operand has 140 places, 108 transitions, 487 flow. Second operand 12 states and 1113 transitions.
[2020-10-11 18:26:24,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 130 transitions, 851 flow
[2020-10-11 18:26:24,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 130 transitions, 797 flow, removed 18 selfloop flow, removed 6 redundant places.
[2020-10-11 18:26:24,261 INFO  L241             Difference]: Finished difference. Result has 149 places, 110 transitions, 530 flow
[2020-10-11 18:26:24,262 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=530, PETRI_PLACES=149, PETRI_TRANSITIONS=110}
[2020-10-11 18:26:24,262 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 35 predicate places.
[2020-10-11 18:26:24,262 INFO  L481      AbstractCegarLoop]: Abstraction has has 149 places, 110 transitions, 530 flow
[2020-10-11 18:26:24,262 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:24,262 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:24,263 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:24,263 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 18:26:24,263 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:24,263 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:24,263 INFO  L82        PathProgramCache]: Analyzing trace with hash -1725179555, now seen corresponding path program 3 times
[2020-10-11 18:26:24,264 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:24,264 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312047615]
[2020-10-11 18:26:24,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:24,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:24,530 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:24,531 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312047615]
[2020-10-11 18:26:24,531 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:24,531 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:26:24,531 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031875448]
[2020-10-11 18:26:24,532 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:26:24,532 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:24,532 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:26:24,532 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:26:25,442 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:25,443 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 110 transitions, 530 flow. Second operand 10 states.
[2020-10-11 18:26:25,443 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:25,443 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:25,443 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:26,115 INFO  L129       PetriNetUnfolder]: 402/1108 cut-off events.
[2020-10-11 18:26:26,115 INFO  L130       PetriNetUnfolder]: For 13925/14212 co-relation queries the response was YES.
[2020-10-11 18:26:26,129 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 1108 events. 402/1108 cut-off events. For 13925/14212 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7808 event pairs, 82 based on Foata normal form. 51/1106 useless extension candidates. Maximal degree in co-relation 6462. Up to 394 conditions per place. 
[2020-10-11 18:26:26,141 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 22 selfloop transitions, 23 changer transitions 19/140 dead transitions.
[2020-10-11 18:26:26,142 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 140 transitions, 1150 flow
[2020-10-11 18:26:26,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:26,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:26,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1209 transitions.
[2020-10-11 18:26:26,146 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8691588785046729
[2020-10-11 18:26:26,146 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1209 transitions.
[2020-10-11 18:26:26,146 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1209 transitions.
[2020-10-11 18:26:26,147 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:26,147 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1209 transitions.
[2020-10-11 18:26:26,149 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:26,151 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:26,152 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:26,152 INFO  L185             Difference]: Start difference. First operand has 149 places, 110 transitions, 530 flow. Second operand 13 states and 1209 transitions.
[2020-10-11 18:26:26,152 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 140 transitions, 1150 flow
[2020-10-11 18:26:26,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 140 transitions, 1089 flow, removed 19 selfloop flow, removed 7 redundant places.
[2020-10-11 18:26:26,180 INFO  L241             Difference]: Finished difference. Result has 156 places, 116 transitions, 682 flow
[2020-10-11 18:26:26,180 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=682, PETRI_PLACES=156, PETRI_TRANSITIONS=116}
[2020-10-11 18:26:26,180 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 42 predicate places.
[2020-10-11 18:26:26,181 INFO  L481      AbstractCegarLoop]: Abstraction has has 156 places, 116 transitions, 682 flow
[2020-10-11 18:26:26,181 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:26:26,181 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:26,181 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:26,181 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 18:26:26,181 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:26,182 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:26,182 INFO  L82        PathProgramCache]: Analyzing trace with hash -34968273, now seen corresponding path program 4 times
[2020-10-11 18:26:26,182 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:26,182 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736722208]
[2020-10-11 18:26:26,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:26,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:26,375 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,375 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736722208]
[2020-10-11 18:26:26,375 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:26,375 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-11 18:26:26,375 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488231976]
[2020-10-11 18:26:26,376 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 18:26:26,376 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:26,376 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 18:26:26,376 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-10-11 18:26:27,023 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 107
[2020-10-11 18:26:27,024 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 116 transitions, 682 flow. Second operand 8 states.
[2020-10-11 18:26:27,024 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:27,024 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 107
[2020-10-11 18:26:27,024 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:27,596 INFO  L129       PetriNetUnfolder]: 364/1030 cut-off events.
[2020-10-11 18:26:27,597 INFO  L130       PetriNetUnfolder]: For 16873/17001 co-relation queries the response was YES.
[2020-10-11 18:26:27,607 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6649 conditions, 1030 events. 364/1030 cut-off events. For 16873/17001 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7173 event pairs, 90 based on Foata normal form. 37/1012 useless extension candidates. Maximal degree in co-relation 6559. Up to 317 conditions per place. 
[2020-10-11 18:26:27,615 INFO  L132   encePairwiseOnDemand]: 98/107 looper letters, 20 selfloop transitions, 18 changer transitions 20/141 dead transitions.
[2020-10-11 18:26:27,616 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 141 transitions, 1254 flow
[2020-10-11 18:26:27,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-11 18:26:27,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-10-11 18:26:27,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1053 transitions.
[2020-10-11 18:26:27,618 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8946474086661003
[2020-10-11 18:26:27,618 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1053 transitions.
[2020-10-11 18:26:27,618 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1053 transitions.
[2020-10-11 18:26:27,619 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:27,619 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1053 transitions.
[2020-10-11 18:26:27,621 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 12 states.
[2020-10-11 18:26:27,622 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states.
[2020-10-11 18:26:27,622 INFO  L81            ComplementDD]: Finished complementDD. Result 12 states.
[2020-10-11 18:26:27,622 INFO  L185             Difference]: Start difference. First operand has 156 places, 116 transitions, 682 flow. Second operand 11 states and 1053 transitions.
[2020-10-11 18:26:27,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 141 transitions, 1254 flow
[2020-10-11 18:26:27,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 141 transitions, 1061 flow, removed 90 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:27,651 INFO  L241             Difference]: Finished difference. Result has 155 places, 117 transitions, 684 flow
[2020-10-11 18:26:27,652 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=684, PETRI_PLACES=155, PETRI_TRANSITIONS=117}
[2020-10-11 18:26:27,652 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places.
[2020-10-11 18:26:27,652 INFO  L481      AbstractCegarLoop]: Abstraction has has 155 places, 117 transitions, 684 flow
[2020-10-11 18:26:27,652 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 18:26:27,653 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:27,653 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:27,653 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 18:26:27,653 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:27,653 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:27,654 INFO  L82        PathProgramCache]: Analyzing trace with hash -10351850, now seen corresponding path program 1 times
[2020-10-11 18:26:27,654 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:27,654 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344524423]
[2020-10-11 18:26:27,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:27,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:28,012 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,012 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344524423]
[2020-10-11 18:26:28,013 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:28,013 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-11 18:26:28,013 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572516124]
[2020-10-11 18:26:28,013 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-11 18:26:28,014 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:28,014 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-11 18:26:28,014 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2020-10-11 18:26:29,205 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107
[2020-10-11 18:26:29,206 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 117 transitions, 684 flow. Second operand 12 states.
[2020-10-11 18:26:29,206 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:29,206 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107
[2020-10-11 18:26:29,206 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:29,804 INFO  L129       PetriNetUnfolder]: 272/820 cut-off events.
[2020-10-11 18:26:29,805 INFO  L130       PetriNetUnfolder]: For 13246/13533 co-relation queries the response was YES.
[2020-10-11 18:26:29,812 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5087 conditions, 820 events. 272/820 cut-off events. For 13246/13533 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5344 event pairs, 70 based on Foata normal form. 37/815 useless extension candidates. Maximal degree in co-relation 4995. Up to 361 conditions per place. 
[2020-10-11 18:26:29,820 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 31 selfloop transitions, 15 changer transitions 10/130 dead transitions.
[2020-10-11 18:26:29,821 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 130 transitions, 1026 flow
[2020-10-11 18:26:29,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:29,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:29,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1256 transitions.
[2020-10-11 18:26:29,823 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8384512683578104
[2020-10-11 18:26:29,823 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1256 transitions.
[2020-10-11 18:26:29,823 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1256 transitions.
[2020-10-11 18:26:29,824 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:29,824 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1256 transitions.
[2020-10-11 18:26:29,826 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:29,828 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:29,829 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:29,829 INFO  L185             Difference]: Start difference. First operand has 155 places, 117 transitions, 684 flow. Second operand 14 states and 1256 transitions.
[2020-10-11 18:26:29,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 130 transitions, 1026 flow
[2020-10-11 18:26:29,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 130 transitions, 904 flow, removed 47 selfloop flow, removed 10 redundant places.
[2020-10-11 18:26:29,847 INFO  L241             Difference]: Finished difference. Result has 159 places, 118 transitions, 697 flow
[2020-10-11 18:26:29,848 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=697, PETRI_PLACES=159, PETRI_TRANSITIONS=118}
[2020-10-11 18:26:29,848 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 45 predicate places.
[2020-10-11 18:26:29,848 INFO  L481      AbstractCegarLoop]: Abstraction has has 159 places, 118 transitions, 697 flow
[2020-10-11 18:26:29,848 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-11 18:26:29,849 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:29,849 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:29,849 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 18:26:29,849 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:29,849 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:29,850 INFO  L82        PathProgramCache]: Analyzing trace with hash 1203503028, now seen corresponding path program 2 times
[2020-10-11 18:26:29,850 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:29,850 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784775534]
[2020-10-11 18:26:29,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:29,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:30,203 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,203 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784775534]
[2020-10-11 18:26:30,204 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:30,204 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-10-11 18:26:30,204 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368901305]
[2020-10-11 18:26:30,205 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-11 18:26:30,205 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:30,205 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-11 18:26:30,206 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2020-10-11 18:26:31,685 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2020-10-11 18:26:31,686 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 118 transitions, 697 flow. Second operand 13 states.
[2020-10-11 18:26:31,686 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:31,686 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2020-10-11 18:26:31,687 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:32,239 INFO  L129       PetriNetUnfolder]: 269/812 cut-off events.
[2020-10-11 18:26:32,239 INFO  L130       PetriNetUnfolder]: For 11712/12014 co-relation queries the response was YES.
[2020-10-11 18:26:32,248 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 812 events. 269/812 cut-off events. For 11712/12014 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5290 event pairs, 41 based on Foata normal form. 48/817 useless extension candidates. Maximal degree in co-relation 4823. Up to 303 conditions per place. 
[2020-10-11 18:26:32,255 INFO  L132   encePairwiseOnDemand]: 95/107 looper letters, 24 selfloop transitions, 27 changer transitions 10/136 dead transitions.
[2020-10-11 18:26:32,255 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 136 transitions, 1112 flow
[2020-10-11 18:26:32,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:32,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:32,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1362 transitions.
[2020-10-11 18:26:32,258 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8485981308411215
[2020-10-11 18:26:32,258 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1362 transitions.
[2020-10-11 18:26:32,258 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1362 transitions.
[2020-10-11 18:26:32,259 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:32,259 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1362 transitions.
[2020-10-11 18:26:32,261 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:32,263 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:32,263 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:32,263 INFO  L185             Difference]: Start difference. First operand has 159 places, 118 transitions, 697 flow. Second operand 15 states and 1362 transitions.
[2020-10-11 18:26:32,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 136 transitions, 1112 flow
[2020-10-11 18:26:32,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 136 transitions, 977 flow, removed 52 selfloop flow, removed 13 redundant places.
[2020-10-11 18:26:32,283 INFO  L241             Difference]: Finished difference. Result has 161 places, 120 transitions, 764 flow
[2020-10-11 18:26:32,283 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=764, PETRI_PLACES=161, PETRI_TRANSITIONS=120}
[2020-10-11 18:26:32,283 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 47 predicate places.
[2020-10-11 18:26:32,283 INFO  L481      AbstractCegarLoop]: Abstraction has has 161 places, 120 transitions, 764 flow
[2020-10-11 18:26:32,284 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-11 18:26:32,284 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:32,284 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:32,284 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 18:26:32,284 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:32,284 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:32,285 INFO  L82        PathProgramCache]: Analyzing trace with hash 414438922, now seen corresponding path program 3 times
[2020-10-11 18:26:32,285 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:32,285 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690990583]
[2020-10-11 18:26:32,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:32,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:32,576 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,576 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690990583]
[2020-10-11 18:26:32,576 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:32,577 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-11 18:26:32,577 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468000050]
[2020-10-11 18:26:32,577 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-11 18:26:32,577 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:32,578 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-11 18:26:32,578 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2020-10-11 18:26:33,742 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:33,743 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 120 transitions, 764 flow. Second operand 12 states.
[2020-10-11 18:26:33,743 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:33,743 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:33,743 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:34,262 INFO  L129       PetriNetUnfolder]: 269/848 cut-off events.
[2020-10-11 18:26:34,263 INFO  L130       PetriNetUnfolder]: For 12709/12999 co-relation queries the response was YES.
[2020-10-11 18:26:34,270 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5179 conditions, 848 events. 269/848 cut-off events. For 12709/12999 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5785 event pairs, 54 based on Foata normal form. 30/834 useless extension candidates. Maximal degree in co-relation 5086. Up to 317 conditions per place. 
[2020-10-11 18:26:34,275 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 31 selfloop transitions, 20 changer transitions 10/136 dead transitions.
[2020-10-11 18:26:34,276 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 136 transitions, 1152 flow
[2020-10-11 18:26:34,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:26:34,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:26:34,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1196 transitions.
[2020-10-11 18:26:34,283 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8598130841121495
[2020-10-11 18:26:34,283 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1196 transitions.
[2020-10-11 18:26:34,283 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1196 transitions.
[2020-10-11 18:26:34,284 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:34,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1196 transitions.
[2020-10-11 18:26:34,285 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:26:34,287 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:26:34,288 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:26:34,288 INFO  L185             Difference]: Start difference. First operand has 161 places, 120 transitions, 764 flow. Second operand 13 states and 1196 transitions.
[2020-10-11 18:26:34,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 136 transitions, 1152 flow
[2020-10-11 18:26:34,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 136 transitions, 1062 flow, removed 36 selfloop flow, removed 12 redundant places.
[2020-10-11 18:26:34,309 INFO  L241             Difference]: Finished difference. Result has 162 places, 121 transitions, 823 flow
[2020-10-11 18:26:34,310 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=823, PETRI_PLACES=162, PETRI_TRANSITIONS=121}
[2020-10-11 18:26:34,310 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 48 predicate places.
[2020-10-11 18:26:34,310 INFO  L481      AbstractCegarLoop]: Abstraction has has 162 places, 121 transitions, 823 flow
[2020-10-11 18:26:34,310 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-11 18:26:34,311 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:34,311 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:34,311 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-11 18:26:34,311 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:34,311 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:34,311 INFO  L82        PathProgramCache]: Analyzing trace with hash 1151759254, now seen corresponding path program 1 times
[2020-10-11 18:26:34,312 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:34,312 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870705717]
[2020-10-11 18:26:34,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:34,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:34,422 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,422 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870705717]
[2020-10-11 18:26:34,423 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:34,423 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:34,423 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150565633]
[2020-10-11 18:26:34,424 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:34,424 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:34,424 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:34,425 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:34,558 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:34,558 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 121 transitions, 823 flow. Second operand 6 states.
[2020-10-11 18:26:34,558 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:34,559 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:34,559 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:35,372 INFO  L129       PetriNetUnfolder]: 2140/4585 cut-off events.
[2020-10-11 18:26:35,372 INFO  L130       PetriNetUnfolder]: For 31864/32167 co-relation queries the response was YES.
[2020-10-11 18:26:35,410 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 17530 conditions, 4585 events. 2140/4585 cut-off events. For 31864/32167 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 41168 event pairs, 269 based on Foata normal form. 96/4062 useless extension candidates. Maximal degree in co-relation 17440. Up to 1238 conditions per place. 
[2020-10-11 18:26:35,444 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 23 selfloop transitions, 19 changer transitions 0/152 dead transitions.
[2020-10-11 18:26:35,444 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 152 transitions, 969 flow
[2020-10-11 18:26:35,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:35,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:35,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions.
[2020-10-11 18:26:35,447 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9148494288681205
[2020-10-11 18:26:35,447 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 881 transitions.
[2020-10-11 18:26:35,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions.
[2020-10-11 18:26:35,447 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:35,447 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions.
[2020-10-11 18:26:35,449 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:35,450 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:35,450 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:35,450 INFO  L185             Difference]: Start difference. First operand has 162 places, 121 transitions, 823 flow. Second operand 9 states and 881 transitions.
[2020-10-11 18:26:35,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 152 transitions, 969 flow
[2020-10-11 18:26:35,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 896 flow, removed 18 selfloop flow, removed 11 redundant places.
[2020-10-11 18:26:35,500 INFO  L241             Difference]: Finished difference. Result has 158 places, 138 transitions, 884 flow
[2020-10-11 18:26:35,500 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=884, PETRI_PLACES=158, PETRI_TRANSITIONS=138}
[2020-10-11 18:26:35,501 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 44 predicate places.
[2020-10-11 18:26:35,501 INFO  L481      AbstractCegarLoop]: Abstraction has has 158 places, 138 transitions, 884 flow
[2020-10-11 18:26:35,501 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:35,501 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:35,501 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:35,501 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-11 18:26:35,501 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:35,502 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:35,502 INFO  L82        PathProgramCache]: Analyzing trace with hash 1628164090, now seen corresponding path program 1 times
[2020-10-11 18:26:35,502 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:35,502 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069097729]
[2020-10-11 18:26:35,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:35,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:35,744 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:35,745 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069097729]
[2020-10-11 18:26:35,745 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:35,745 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-10-11 18:26:35,745 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907908463]
[2020-10-11 18:26:35,746 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-11 18:26:35,746 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:35,746 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-11 18:26:35,747 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2020-10-11 18:26:37,230 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107
[2020-10-11 18:26:37,231 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 138 transitions, 884 flow. Second operand 12 states.
[2020-10-11 18:26:37,231 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:37,231 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107
[2020-10-11 18:26:37,231 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:38,177 INFO  L129       PetriNetUnfolder]: 1218/4068 cut-off events.
[2020-10-11 18:26:38,177 INFO  L130       PetriNetUnfolder]: For 19548/21632 co-relation queries the response was YES.
[2020-10-11 18:26:38,204 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 15396 conditions, 4068 events. 1218/4068 cut-off events. For 19548/21632 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 43260 event pairs, 495 based on Foata normal form. 148/3734 useless extension candidates. Maximal degree in co-relation 15305. Up to 1327 conditions per place. 
[2020-10-11 18:26:38,227 INFO  L132   encePairwiseOnDemand]: 96/107 looper letters, 33 selfloop transitions, 24 changer transitions 0/156 dead transitions.
[2020-10-11 18:26:38,227 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 156 transitions, 1210 flow
[2020-10-11 18:26:38,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-11 18:26:38,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-10-11 18:26:38,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1299 transitions.
[2020-10-11 18:26:38,229 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8671562082777036
[2020-10-11 18:26:38,230 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1299 transitions.
[2020-10-11 18:26:38,230 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1299 transitions.
[2020-10-11 18:26:38,230 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:38,230 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1299 transitions.
[2020-10-11 18:26:38,232 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 15 states.
[2020-10-11 18:26:38,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states.
[2020-10-11 18:26:38,234 INFO  L81            ComplementDD]: Finished complementDD. Result 15 states.
[2020-10-11 18:26:38,234 INFO  L185             Difference]: Start difference. First operand has 158 places, 138 transitions, 884 flow. Second operand 14 states and 1299 transitions.
[2020-10-11 18:26:38,234 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 156 transitions, 1210 flow
[2020-10-11 18:26:38,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 156 transitions, 1194 flow, removed 7 selfloop flow, removed 1 redundant places.
[2020-10-11 18:26:38,266 INFO  L241             Difference]: Finished difference. Result has 177 places, 146 transitions, 1101 flow
[2020-10-11 18:26:38,266 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1101, PETRI_PLACES=177, PETRI_TRANSITIONS=146}
[2020-10-11 18:26:38,266 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 63 predicate places.
[2020-10-11 18:26:38,266 INFO  L481      AbstractCegarLoop]: Abstraction has has 177 places, 146 transitions, 1101 flow
[2020-10-11 18:26:38,267 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-11 18:26:38,267 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:38,267 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:38,267 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-11 18:26:38,267 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:38,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:38,267 INFO  L82        PathProgramCache]: Analyzing trace with hash 420700506, now seen corresponding path program 1 times
[2020-10-11 18:26:38,268 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:38,268 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946913422]
[2020-10-11 18:26:38,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:38,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:38,385 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,386 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946913422]
[2020-10-11 18:26:38,386 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:38,387 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 18:26:38,387 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270572439]
[2020-10-11 18:26:38,389 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 18:26:38,389 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:38,389 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 18:26:38,389 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-11 18:26:38,617 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:38,618 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 146 transitions, 1101 flow. Second operand 7 states.
[2020-10-11 18:26:38,618 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:38,618 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:38,618 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:39,553 INFO  L129       PetriNetUnfolder]: 2358/5170 cut-off events.
[2020-10-11 18:26:39,553 INFO  L130       PetriNetUnfolder]: For 27637/36576 co-relation queries the response was YES.
[2020-10-11 18:26:39,604 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 22405 conditions, 5170 events. 2358/5170 cut-off events. For 27637/36576 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 48966 event pairs, 148 based on Foata normal form. 474/4961 useless extension candidates. Maximal degree in co-relation 22307. Up to 2383 conditions per place. 
[2020-10-11 18:26:39,623 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 25 selfloop transitions, 37 changer transitions 0/180 dead transitions.
[2020-10-11 18:26:39,624 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 180 transitions, 1454 flow
[2020-10-11 18:26:39,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 18:26:39,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-10-11 18:26:39,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1176 transitions.
[2020-10-11 18:26:39,626 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9158878504672897
[2020-10-11 18:26:39,626 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1176 transitions.
[2020-10-11 18:26:39,626 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1176 transitions.
[2020-10-11 18:26:39,626 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:39,627 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1176 transitions.
[2020-10-11 18:26:39,628 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 13 states.
[2020-10-11 18:26:39,630 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states.
[2020-10-11 18:26:39,630 INFO  L81            ComplementDD]: Finished complementDD. Result 13 states.
[2020-10-11 18:26:39,630 INFO  L185             Difference]: Start difference. First operand has 177 places, 146 transitions, 1101 flow. Second operand 12 states and 1176 transitions.
[2020-10-11 18:26:39,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 180 transitions, 1454 flow
[2020-10-11 18:26:39,679 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 180 transitions, 1311 flow, removed 60 selfloop flow, removed 5 redundant places.
[2020-10-11 18:26:39,682 INFO  L241             Difference]: Finished difference. Result has 188 places, 165 transitions, 1238 flow
[2020-10-11 18:26:39,682 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1238, PETRI_PLACES=188, PETRI_TRANSITIONS=165}
[2020-10-11 18:26:39,683 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 74 predicate places.
[2020-10-11 18:26:39,683 INFO  L481      AbstractCegarLoop]: Abstraction has has 188 places, 165 transitions, 1238 flow
[2020-10-11 18:26:39,683 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 18:26:39,683 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:39,683 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:39,683 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-11 18:26:39,683 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:39,684 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:39,684 INFO  L82        PathProgramCache]: Analyzing trace with hash -3816485, now seen corresponding path program 1 times
[2020-10-11 18:26:39,684 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:39,684 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326097880]
[2020-10-11 18:26:39,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:39,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:39,847 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:39,847 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326097880]
[2020-10-11 18:26:39,848 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:39,848 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-11 18:26:39,848 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763357263]
[2020-10-11 18:26:39,848 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 18:26:39,849 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:39,849 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 18:26:39,849 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2020-10-11 18:26:40,530 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107
[2020-10-11 18:26:40,530 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 165 transitions, 1238 flow. Second operand 9 states.
[2020-10-11 18:26:40,530 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:40,530 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107
[2020-10-11 18:26:40,531 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:43,210 INFO  L129       PetriNetUnfolder]: 3221/9591 cut-off events.
[2020-10-11 18:26:43,211 INFO  L130       PetriNetUnfolder]: For 60263/75259 co-relation queries the response was YES.
[2020-10-11 18:26:43,299 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 42229 conditions, 9591 events. 3221/9591 cut-off events. For 60263/75259 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 117966 event pairs, 460 based on Foata normal form. 208/8792 useless extension candidates. Maximal degree in co-relation 42124. Up to 3284 conditions per place. 
[2020-10-11 18:26:43,332 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 51 selfloop transitions, 45 changer transitions 16/226 dead transitions.
[2020-10-11 18:26:43,333 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 226 transitions, 2226 flow
[2020-10-11 18:26:43,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:43,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:43,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 843 transitions.
[2020-10-11 18:26:43,335 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8753894080996885
[2020-10-11 18:26:43,335 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 843 transitions.
[2020-10-11 18:26:43,335 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 843 transitions.
[2020-10-11 18:26:43,335 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:43,335 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 843 transitions.
[2020-10-11 18:26:43,336 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:43,337 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:43,338 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:43,338 INFO  L185             Difference]: Start difference. First operand has 188 places, 165 transitions, 1238 flow. Second operand 9 states and 843 transitions.
[2020-10-11 18:26:43,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 226 transitions, 2226 flow
[2020-10-11 18:26:43,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 226 transitions, 2083 flow, removed 62 selfloop flow, removed 4 redundant places.
[2020-10-11 18:26:43,980 INFO  L241             Difference]: Finished difference. Result has 199 places, 200 transitions, 1762 flow
[2020-10-11 18:26:43,980 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1762, PETRI_PLACES=199, PETRI_TRANSITIONS=200}
[2020-10-11 18:26:43,980 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 85 predicate places.
[2020-10-11 18:26:43,980 INFO  L481      AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 1762 flow
[2020-10-11 18:26:43,980 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 18:26:43,980 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:43,981 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:43,981 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-11 18:26:43,981 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:43,981 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:43,981 INFO  L82        PathProgramCache]: Analyzing trace with hash -1859816485, now seen corresponding path program 2 times
[2020-10-11 18:26:43,981 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:43,981 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171065579]
[2020-10-11 18:26:43,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:44,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:44,096 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,096 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171065579]
[2020-10-11 18:26:44,096 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:44,096 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:26:44,097 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425154224]
[2020-10-11 18:26:44,097 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:26:44,097 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:44,098 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:26:44,098 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:26:44,207 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2020-10-11 18:26:44,208 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 200 transitions, 1762 flow. Second operand 6 states.
[2020-10-11 18:26:44,208 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:44,208 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2020-10-11 18:26:44,208 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:46,540 INFO  L129       PetriNetUnfolder]: 4232/13243 cut-off events.
[2020-10-11 18:26:46,540 INFO  L130       PetriNetUnfolder]: For 72789/79060 co-relation queries the response was YES.
[2020-10-11 18:26:46,716 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 51832 conditions, 13243 events. 4232/13243 cut-off events. For 72789/79060 co-relation queries the response was YES. Maximal size of possible extension queue 1739. Compared 173928 event pairs, 518 based on Foata normal form. 246/12086 useless extension candidates. Maximal degree in co-relation 51724. Up to 3228 conditions per place. 
[2020-10-11 18:26:46,749 INFO  L132   encePairwiseOnDemand]: 101/107 looper letters, 20 selfloop transitions, 22 changer transitions 25/241 dead transitions.
[2020-10-11 18:26:46,749 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 241 transitions, 2392 flow
[2020-10-11 18:26:46,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:26:46,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:26:46,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions.
[2020-10-11 18:26:46,751 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9241952232606438
[2020-10-11 18:26:46,751 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 890 transitions.
[2020-10-11 18:26:46,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions.
[2020-10-11 18:26:46,752 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:46,752 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions.
[2020-10-11 18:26:46,753 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:26:46,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:26:46,754 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:26:46,755 INFO  L185             Difference]: Start difference. First operand has 199 places, 200 transitions, 1762 flow. Second operand 9 states and 890 transitions.
[2020-10-11 18:26:46,755 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 241 transitions, 2392 flow
[2020-10-11 18:26:47,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 241 transitions, 2306 flow, removed 43 selfloop flow, removed 0 redundant places.
[2020-10-11 18:26:47,332 INFO  L241             Difference]: Finished difference. Result has 214 places, 210 transitions, 1948 flow
[2020-10-11 18:26:47,333 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1948, PETRI_PLACES=214, PETRI_TRANSITIONS=210}
[2020-10-11 18:26:47,333 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 100 predicate places.
[2020-10-11 18:26:47,333 INFO  L481      AbstractCegarLoop]: Abstraction has has 214 places, 210 transitions, 1948 flow
[2020-10-11 18:26:47,333 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:26:47,333 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:47,333 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:47,334 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-11 18:26:47,334 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:47,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:47,334 INFO  L82        PathProgramCache]: Analyzing trace with hash 1347765595, now seen corresponding path program 1 times
[2020-10-11 18:26:47,334 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:47,334 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400821242]
[2020-10-11 18:26:47,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:47,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:47,751 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,752 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400821242]
[2020-10-11 18:26:47,752 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:47,752 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-11 18:26:47,753 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445223792]
[2020-10-11 18:26:47,753 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 18:26:47,753 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:47,753 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 18:26:47,753 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-11 18:26:48,003 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:48,004 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 210 transitions, 1948 flow. Second operand 8 states.
[2020-10-11 18:26:48,004 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:48,004 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:48,004 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:52,242 INFO  L129       PetriNetUnfolder]: 7626/15927 cut-off events.
[2020-10-11 18:26:52,243 INFO  L130       PetriNetUnfolder]: For 131888/171901 co-relation queries the response was YES.
[2020-10-11 18:26:52,481 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 78277 conditions, 15927 events. 7626/15927 cut-off events. For 131888/171901 co-relation queries the response was YES. Maximal size of possible extension queue 2594. Compared 182006 event pairs, 42 based on Foata normal form. 2901/17043 useless extension candidates. Maximal degree in co-relation 78161. Up to 6637 conditions per place. 
[2020-10-11 18:26:52,527 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 19 selfloop transitions, 57 changer transitions 40/229 dead transitions.
[2020-10-11 18:26:52,528 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 2296 flow
[2020-10-11 18:26:52,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:26:52,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:26:52,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1471 transitions.
[2020-10-11 18:26:52,530 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9165109034267913
[2020-10-11 18:26:52,530 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1471 transitions.
[2020-10-11 18:26:52,530 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1471 transitions.
[2020-10-11 18:26:52,531 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:52,531 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1471 transitions.
[2020-10-11 18:26:52,533 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:26:52,534 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:26:52,535 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:26:52,535 INFO  L185             Difference]: Start difference. First operand has 214 places, 210 transitions, 1948 flow. Second operand 15 states and 1471 transitions.
[2020-10-11 18:26:52,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 2296 flow
[2020-10-11 18:26:53,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 229 transitions, 2186 flow, removed 36 selfloop flow, removed 8 redundant places.
[2020-10-11 18:26:53,410 INFO  L241             Difference]: Finished difference. Result has 223 places, 185 transitions, 1601 flow
[2020-10-11 18:26:53,410 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1601, PETRI_PLACES=223, PETRI_TRANSITIONS=185}
[2020-10-11 18:26:53,410 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 109 predicate places.
[2020-10-11 18:26:53,410 INFO  L481      AbstractCegarLoop]: Abstraction has has 223 places, 185 transitions, 1601 flow
[2020-10-11 18:26:53,411 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 18:26:53,411 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:26:53,411 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:53,411 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-11 18:26:53,411 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:26:53,411 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:26:53,411 INFO  L82        PathProgramCache]: Analyzing trace with hash 585057822, now seen corresponding path program 1 times
[2020-10-11 18:26:53,412 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:26:53,412 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167836927]
[2020-10-11 18:26:53,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:26:53,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:26:53,550 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,551 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167836927]
[2020-10-11 18:26:53,551 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:26:53,551 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-11 18:26:53,551 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965943103]
[2020-10-11 18:26:53,552 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 18:26:53,552 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:26:53,552 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 18:26:53,553 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-10-11 18:26:53,818 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2020-10-11 18:26:53,819 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 185 transitions, 1601 flow. Second operand 9 states.
[2020-10-11 18:26:53,819 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:26:53,820 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2020-10-11 18:26:53,820 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:26:56,490 INFO  L129       PetriNetUnfolder]: 6854/14638 cut-off events.
[2020-10-11 18:26:56,490 INFO  L130       PetriNetUnfolder]: For 137191/178306 co-relation queries the response was YES.
[2020-10-11 18:26:56,750 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 80422 conditions, 14638 events. 6854/14638 cut-off events. For 137191/178306 co-relation queries the response was YES. Maximal size of possible extension queue 2582. Compared 171974 event pairs, 9 based on Foata normal form. 2747/15610 useless extension candidates. Maximal degree in co-relation 80348. Up to 5960 conditions per place. 
[2020-10-11 18:26:56,799 INFO  L132   encePairwiseOnDemand]: 97/107 looper letters, 12 selfloop transitions, 63 changer transitions 21/204 dead transitions.
[2020-10-11 18:26:56,799 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 204 transitions, 1958 flow
[2020-10-11 18:26:56,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2020-10-11 18:26:56,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2020-10-11 18:26:56,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1750 transitions.
[2020-10-11 18:26:56,802 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9086188992731049
[2020-10-11 18:26:56,802 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1750 transitions.
[2020-10-11 18:26:56,802 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1750 transitions.
[2020-10-11 18:26:56,803 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:26:56,803 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1750 transitions.
[2020-10-11 18:26:56,805 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 19 states.
[2020-10-11 18:26:56,806 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states.
[2020-10-11 18:26:56,806 INFO  L81            ComplementDD]: Finished complementDD. Result 19 states.
[2020-10-11 18:26:56,806 INFO  L185             Difference]: Start difference. First operand has 223 places, 185 transitions, 1601 flow. Second operand 18 states and 1750 transitions.
[2020-10-11 18:26:56,806 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 204 transitions, 1958 flow
[2020-10-11 18:27:07,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 204 transitions, 1399 flow, removed 210 selfloop flow, removed 45 redundant places.
[2020-10-11 18:27:07,203 INFO  L241             Difference]: Finished difference. Result has 186 places, 179 transitions, 1214 flow
[2020-10-11 18:27:07,203 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1214, PETRI_PLACES=186, PETRI_TRANSITIONS=179}
[2020-10-11 18:27:07,203 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 72 predicate places.
[2020-10-11 18:27:07,203 INFO  L481      AbstractCegarLoop]: Abstraction has has 186 places, 179 transitions, 1214 flow
[2020-10-11 18:27:07,203 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 18:27:07,203 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:27:07,203 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:07,204 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-10-11 18:27:07,204 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:07,204 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:27:07,204 INFO  L82        PathProgramCache]: Analyzing trace with hash 1870181852, now seen corresponding path program 1 times
[2020-10-11 18:27:07,204 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:27:07,205 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470290512]
[2020-10-11 18:27:07,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:27:07,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:27:07,314 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:07,316 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470290512]
[2020-10-11 18:27:07,316 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:27:07,316 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 18:27:07,316 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366998927]
[2020-10-11 18:27:07,317 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 18:27:07,317 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:27:07,317 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 18:27:07,317 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-10-11 18:27:07,923 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107
[2020-10-11 18:27:07,924 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 179 transitions, 1214 flow. Second operand 7 states.
[2020-10-11 18:27:07,924 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:27:07,924 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107
[2020-10-11 18:27:07,924 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:27:09,556 INFO  L129       PetriNetUnfolder]: 6304/15696 cut-off events.
[2020-10-11 18:27:09,556 INFO  L130       PetriNetUnfolder]: For 44439/50142 co-relation queries the response was YES.
[2020-10-11 18:27:09,758 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 52843 conditions, 15696 events. 6304/15696 cut-off events. For 44439/50142 co-relation queries the response was YES. Maximal size of possible extension queue 2761. Compared 204615 event pairs, 4 based on Foata normal form. 2/13839 useless extension candidates. Maximal degree in co-relation 52754. Up to 2179 conditions per place. 
[2020-10-11 18:27:09,771 INFO  L132   encePairwiseOnDemand]: 101/107 looper letters, 9 selfloop transitions, 1 changer transitions 38/184 dead transitions.
[2020-10-11 18:27:09,771 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 184 transitions, 1266 flow
[2020-10-11 18:27:09,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 18:27:09,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-11 18:27:09,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions.
[2020-10-11 18:27:09,772 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9092122830440588
[2020-10-11 18:27:09,772 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 681 transitions.
[2020-10-11 18:27:09,772 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions.
[2020-10-11 18:27:09,773 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:27:09,773 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions.
[2020-10-11 18:27:09,774 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-11 18:27:09,775 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-11 18:27:09,775 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-11 18:27:09,775 INFO  L185             Difference]: Start difference. First operand has 186 places, 179 transitions, 1214 flow. Second operand 7 states and 681 transitions.
[2020-10-11 18:27:09,775 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 184 transitions, 1266 flow
[2020-10-11 18:27:13,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 184 transitions, 1114 flow, removed 12 selfloop flow, removed 17 redundant places.
[2020-10-11 18:27:13,200 INFO  L241             Difference]: Finished difference. Result has 178 places, 146 transitions, 772 flow
[2020-10-11 18:27:13,200 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=178, PETRI_TRANSITIONS=146}
[2020-10-11 18:27:13,200 INFO  L341   CegarLoopForPetriNet]: 114 programPoint places, 64 predicate places.
[2020-10-11 18:27:13,200 INFO  L481      AbstractCegarLoop]: Abstraction has has 178 places, 146 transitions, 772 flow
[2020-10-11 18:27:13,200 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 18:27:13,200 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:27:13,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, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 18:27:13,201 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2020-10-11 18:27:13,201 INFO  L429      AbstractCegarLoop]: === Iteration 25 === [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:13,201 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:27:13,201 INFO  L82        PathProgramCache]: Analyzing trace with hash 281165978, now seen corresponding path program 2 times
[2020-10-11 18:27:13,202 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:27:13,202 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292757031]
[2020-10-11 18:27:13,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:27:13,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 18:27:13,235 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 18:27:13,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 18:27:13,273 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 18:27:13,320 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 18:27:13,321 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 18:27:13,321 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2020-10-11 18:27:13,353 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:13,353 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,355 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:13,355 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,355 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:13,355 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,356 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:13,356 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,356 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:13,356 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,356 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:13,356 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,357 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:13,357 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,357 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:13,357 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,358 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:13,358 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,358 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:13,358 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,358 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:13,358 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,359 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:13,359 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,360 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:13,360 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,360 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:13,360 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,360 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:13,360 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,361 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:13,361 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,361 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:13,361 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,361 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:13,362 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,362 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:13,362 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,362 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:13,362 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,362 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:13,363 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,363 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:13,363 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,363 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:13,363 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,363 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:13,364 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,364 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:13,364 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,364 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:13,364 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,364 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:13,364 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,365 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:13,365 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,365 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:13,365 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,365 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:13,366 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:27:13,509 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:27:13 BasicIcfg
[2020-10-11 18:27:13,510 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 18:27:13,516 INFO  L168              Benchmark]: Toolchain (without parser) took 67380.16 ms. Allocated memory was 248.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 203.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 694.1 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:13,518 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 18:27:13,519 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 719.28 ms. Allocated memory was 248.5 MB in the beginning and 307.8 MB in the end (delta: 59.2 MB). Free memory was 203.6 MB in the beginning and 258.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:13,522 INFO  L168              Benchmark]: Boogie Procedure Inliner took 67.76 ms. Allocated memory is still 307.8 MB. Free memory was 255.8 MB in the beginning and 253.3 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:13,522 INFO  L168              Benchmark]: Boogie Preprocessor took 67.28 ms. Allocated memory is still 307.8 MB. Free memory was 253.3 MB in the beginning and 250.8 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:13,523 INFO  L168              Benchmark]: RCFGBuilder took 1920.78 ms. Allocated memory was 307.8 MB in the beginning and 356.0 MB in the end (delta: 48.2 MB). Free memory was 250.8 MB in the beginning and 204.1 MB in the end (delta: 46.7 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:13,525 INFO  L168              Benchmark]: TraceAbstraction took 64597.34 ms. Allocated memory was 356.0 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 204.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 587.1 MB. Max. memory is 14.2 GB.
[2020-10-11 18:27:13,533 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.26 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 719.28 ms. Allocated memory was 248.5 MB in the beginning and 307.8 MB in the end (delta: 59.2 MB). Free memory was 203.6 MB in the beginning and 258.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 67.76 ms. Allocated memory is still 307.8 MB. Free memory was 255.8 MB in the beginning and 253.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 67.28 ms. Allocated memory is still 307.8 MB. Free memory was 253.3 MB in the beginning and 250.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1920.78 ms. Allocated memory was 307.8 MB in the beginning and 356.0 MB in the end (delta: 48.2 MB). Free memory was 250.8 MB in the beginning and 204.1 MB in the end (delta: 46.7 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 64597.34 ms. Allocated memory was 356.0 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 204.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 587.1 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 t1517;
        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(&t1517, ((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 t1518;
        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]
[L826]  FCALL, FORK  0  pthread_create(&t1518, ((void *)0), P1, ((void *)0))
        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]
[L827]               0  pthread_t t1519;
        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]
[L828]  FCALL, FORK  0  pthread_create(&t1519, ((void *)0), P2, ((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]
[L829]               0  pthread_t t1520;
        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]
[L830]  FCALL, FORK  0  pthread_create(&t1520, ((void *)0), P3, ((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]
[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}, 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}, 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}, 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}, 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]
[L768]               3  z = 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}, 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
[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=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]
[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=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]
[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=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]
[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
[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=0, 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=0, 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=0, 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: 64.2s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 58.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 672 SDtfs, 1315 SDslu, 3800 SDs, 0 SdLazy, 3713 SolverSat, 558 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1948occurred in iteration=21, 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.9s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 602691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...