./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version b5237d83
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-b5237d8
[2022-11-21 16:31:16,021 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-21 16:31:16,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-21 16:31:16,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-21 16:31:16,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-21 16:31:16,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-21 16:31:16,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-21 16:31:16,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-21 16:31:16,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-21 16:31:16,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-21 16:31:16,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-21 16:31:16,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-21 16:31:16,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-21 16:31:16,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-21 16:31:16,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-21 16:31:16,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-21 16:31:16,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-21 16:31:16,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-21 16:31:16,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-21 16:31:16,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-21 16:31:16,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-21 16:31:16,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-21 16:31:16,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-21 16:31:16,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-21 16:31:16,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-21 16:31:16,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-21 16:31:16,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-21 16:31:16,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-21 16:31:16,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-21 16:31:16,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-21 16:31:16,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-21 16:31:16,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-21 16:31:16,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-21 16:31:16,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-21 16:31:16,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-21 16:31:16,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-21 16:31:16,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-21 16:31:16,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-21 16:31:16,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-21 16:31:16,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-21 16:31:16,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-21 16:31:16,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-21 16:31:16,151 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-21 16:31:16,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-21 16:31:16,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-21 16:31:16,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-21 16:31:16,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-21 16:31:16,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-21 16:31:16,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-21 16:31:16,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-21 16:31:16,155 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-21 16:31:16,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-21 16:31:16,156 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-21 16:31:16,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-21 16:31:16,157 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-21 16:31:16,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-21 16:31:16,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-21 16:31:16,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-21 16:31:16,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-21 16:31:16,158 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-21 16:31:16,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-21 16:31:16,158 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-21 16:31:16,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-21 16:31:16,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-21 16:31:16,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-21 16:31:16,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-21 16:31:16,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-21 16:31:16,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-21 16:31:16,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-21 16:31:16,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-21 16:31:16,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-21 16:31:16,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-21 16:31:16,161 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-21 16:31:16,162 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-21 16:31:16,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-21 16:31:16,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b
[2022-11-21 16:31:16,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-21 16:31:16,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-21 16:31:16,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-21 16:31:16,537 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-21 16:31:16,538 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-21 16:31:16,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i
[2022-11-21 16:31:19,508 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2022-11-21 16:31:19,886 INFO L351 CDTParser]: Found 1 translation units.
[2022-11-21 16:31:19,887 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i
[2022-11-21 16:31:19,904 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/data/52001e777/b728217c781a4f28b9effab453930e7b/FLAGe6af79e61
[2022-11-21 16:31:19,927 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/data/52001e777/b728217c781a4f28b9effab453930e7b
[2022-11-21 16:31:19,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-21 16:31:19,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-21 16:31:19,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-21 16:31:19,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-21 16:31:19,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-21 16:31:19,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:31:19" (1/1) ...
[2022-11-21 16:31:19,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416d2cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:19, skipping insertion in model container
[2022-11-21 16:31:19,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:31:19" (1/1) ...
[2022-11-21 16:31:19,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-21 16:31:20,022 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-21 16:31:20,299 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007]
[2022-11-21 16:31:20,620 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-21 16:31:20,630 INFO L203 MainTranslator]: Completed pre-run
[2022-11-21 16:31:20,643 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007]
[2022-11-21 16:31:20,688 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-21 16:31:20,719 INFO L208 MainTranslator]: Completed translation
[2022-11-21 16:31:20,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20 WrapperNode
[2022-11-21 16:31:20,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-21 16:31:20,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-21 16:31:20,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-21 16:31:20,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-21 16:31:20,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,770 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194
[2022-11-21 16:31:20,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-21 16:31:20,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-21 16:31:20,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-21 16:31:20,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-21 16:31:20,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,803 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-21 16:31:20,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-21 16:31:20,827 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-21 16:31:20,827 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-21 16:31:20,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (1/1) ...
[2022-11-21 16:31:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-21 16:31:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/z3
[2022-11-21 16:31:20,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-21 16:31:20,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-21 16:31:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-11-21 16:31:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-21 16:31:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-21 16:31:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-21 16:31:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-21 16:31:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-21 16:31:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-11-21 16:31:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-11-21 16:31:20,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-11-21 16:31:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-11-21 16:31:20,930 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2022-11-21 16:31:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2022-11-21 16:31:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2022-11-21 16:31:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2022-11-21 16:31:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-21 16:31:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-21 16:31:20,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-21 16:31:20,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-21 16:31:20,933 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-11-21 16:31:21,195 INFO L235 CfgBuilder]: Building ICFG
[2022-11-21 16:31:21,197 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-21 16:31:21,890 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-21 16:31:22,321 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-21 16:31:22,321 INFO L300 CfgBuilder]: Removed 0 assume(true) statements.
[2022-11-21 16:31:22,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:31:22 BoogieIcfgContainer
[2022-11-21 16:31:22,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-21 16:31:22,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-21 16:31:22,327 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-21 16:31:22,330 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-21 16:31:22,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:31:19" (1/3) ...
[2022-11-21 16:31:22,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f093d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:31:22, skipping insertion in model container
[2022-11-21 16:31:22,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:31:20" (2/3) ...
[2022-11-21 16:31:22,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f093d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:31:22, skipping insertion in model container
[2022-11-21 16:31:22,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:31:22" (3/3) ...
[2022-11-21 16:31:22,337 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i
[2022-11-21 16:31:22,346 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-11-21 16:31:22,357 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-21 16:31:22,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-11-21 16:31:22,357 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-21 16:31:22,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-11-21 16:31:22,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 153 transitions, 326 flow
[2022-11-21 16:31:22,652 INFO L130 PetriNetUnfolder]: 2/149 cut-off events.
[2022-11-21 16:31:22,653 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-21 16:31:22,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place.
[2022-11-21 16:31:22,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 153 transitions, 326 flow
[2022-11-21 16:31:22,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 149 transitions, 310 flow
[2022-11-21 16:31:22,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-21 16:31:22,691 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60c7da87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-21 16:31:22,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2022-11-21 16:31:22,719 INFO L130 PetriNetUnfolder]: 0/83 cut-off events.
[2022-11-21 16:31:22,720 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-21 16:31:22,720 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:22,721 INFO L209 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]
[2022-11-21 16:31:22,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1790650586, now seen corresponding path program 1 times
[2022-11-21 16:31:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371252764]
[2022-11-21 16:31:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:23,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:23,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371252764]
[2022-11-21 16:31:23,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371252764] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:23,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:23,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-21 16:31:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634134254]
[2022-11-21 16:31:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:23,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-21 16:31:23,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:23,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-21 16:31:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-21 16:31:23,576 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 153
[2022-11-21 16:31:23,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 149 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:23,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:23,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 153
[2022-11-21 16:31:23,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:24,132 INFO L130 PetriNetUnfolder]: 258/937 cut-off events.
[2022-11-21 16:31:24,132 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES.
[2022-11-21 16:31:24,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 937 events. 258/937 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5514 event pairs, 58 based on Foata normal form. 36/917 useless extension candidates. Maximal degree in co-relation 1313. Up to 289 conditions per place.
[2022-11-21 16:31:24,150 INFO L137 encePairwiseOnDemand]: 148/153 looper letters, 19 selfloop transitions, 2 changer transitions 0/153 dead transitions.
[2022-11-21 16:31:24,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 153 transitions, 366 flow
[2022-11-21 16:31:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-21 16:31:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-21 16:31:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2022-11-21 16:31:24,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9455337690631809
[2022-11-21 16:31:24,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2022-11-21 16:31:24,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2022-11-21 16:31:24,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:24,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2022-11-21 16:31:24,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:24,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:24,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:24,200 INFO L175 Difference]: Start difference. First operand has 160 places, 149 transitions, 310 flow. Second operand 3 states and 434 transitions.
[2022-11-21 16:31:24,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 153 transitions, 366 flow
[2022-11-21 16:31:24,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 153 transitions, 360 flow, removed 0 selfloop flow, removed 4 redundant places.
[2022-11-21 16:31:24,210 INFO L231 Difference]: Finished difference. Result has 156 places, 145 transitions, 302 flow
[2022-11-21 16:31:24,213 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=156, PETRI_TRANSITIONS=145}
[2022-11-21 16:31:24,220 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -4 predicate places.
[2022-11-21 16:31:24,220 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 302 flow
[2022-11-21 16:31:24,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:24,221 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:24,221 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-21 16:31:24,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1270341058, now seen corresponding path program 1 times
[2022-11-21 16:31:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819633535]
[2022-11-21 16:31:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819633535]
[2022-11-21 16:31:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819633535] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:24,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:24,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-21 16:31:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999907891]
[2022-11-21 16:31:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:24,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-21 16:31:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-21 16:31:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-21 16:31:24,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 153
[2022-11-21 16:31:24,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 145 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:24,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:24,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 153
[2022-11-21 16:31:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:26,470 INFO L130 PetriNetUnfolder]: 1428/3793 cut-off events.
[2022-11-21 16:31:26,470 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES.
[2022-11-21 16:31:26,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 3793 events. 1428/3793 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 30583 event pairs, 741 based on Foata normal form. 0/3670 useless extension candidates. Maximal degree in co-relation 6074. Up to 1041 conditions per place.
[2022-11-21 16:31:26,494 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 26 selfloop transitions, 2 changer transitions 59/199 dead transitions.
[2022-11-21 16:31:26,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 199 transitions, 578 flow
[2022-11-21 16:31:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-21 16:31:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-21 16:31:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1237 transitions.
[2022-11-21 16:31:26,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8983297022512708
[2022-11-21 16:31:26,502 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1237 transitions.
[2022-11-21 16:31:26,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1237 transitions.
[2022-11-21 16:31:26,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:26,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1237 transitions.
[2022-11-21 16:31:26,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.44444444444446) internal successors, (1237), 9 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:26,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 153.0) internal successors, (1530), 10 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:26,511 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 153.0) internal successors, (1530), 10 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:26,511 INFO L175 Difference]: Start difference. First operand has 156 places, 145 transitions, 302 flow. Second operand 9 states and 1237 transitions.
[2022-11-21 16:31:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 199 transitions, 578 flow
[2022-11-21 16:31:26,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 199 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-21 16:31:26,520 INFO L231 Difference]: Finished difference. Result has 169 places, 131 transitions, 290 flow
[2022-11-21 16:31:26,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=290, PETRI_PLACES=169, PETRI_TRANSITIONS=131}
[2022-11-21 16:31:26,522 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 9 predicate places.
[2022-11-21 16:31:26,522 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 131 transitions, 290 flow
[2022-11-21 16:31:26,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:26,523 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:26,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-21 16:31:26,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -419838877, now seen corresponding path program 1 times
[2022-11-21 16:31:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:26,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289030595]
[2022-11-21 16:31:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:26,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289030595]
[2022-11-21 16:31:26,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289030595] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:26,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:26,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:31:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716427278]
[2022-11-21 16:31:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:26,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-21 16:31:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-21 16:31:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-21 16:31:26,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 153
[2022-11-21 16:31:26,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 131 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:26,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:26,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 153
[2022-11-21 16:31:26,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:28,911 INFO L130 PetriNetUnfolder]: 2084/3745 cut-off events.
[2022-11-21 16:31:28,911 INFO L131 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES.
[2022-11-21 16:31:28,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7701 conditions, 3745 events. 2084/3745 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23234 event pairs, 384 based on Foata normal form. 72/3673 useless extension candidates. Maximal degree in co-relation 7617. Up to 1149 conditions per place.
[2022-11-21 16:31:28,935 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 31 selfloop transitions, 4 changer transitions 53/197 dead transitions.
[2022-11-21 16:31:28,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 197 transitions, 621 flow
[2022-11-21 16:31:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-21 16:31:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-21 16:31:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1350 transitions.
[2022-11-21 16:31:28,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706
[2022-11-21 16:31:28,940 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1350 transitions.
[2022-11-21 16:31:28,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1350 transitions.
[2022-11-21 16:31:28,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:28,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1350 transitions.
[2022-11-21 16:31:28,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:28,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:28,949 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:28,949 INFO L175 Difference]: Start difference. First operand has 169 places, 131 transitions, 290 flow. Second operand 10 states and 1350 transitions.
[2022-11-21 16:31:28,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 197 transitions, 621 flow
[2022-11-21 16:31:28,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 197 transitions, 587 flow, removed 14 selfloop flow, removed 8 redundant places.
[2022-11-21 16:31:28,985 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 304 flow
[2022-11-21 16:31:28,985 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=158, PETRI_TRANSITIONS=131}
[2022-11-21 16:31:28,986 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -2 predicate places.
[2022-11-21 16:31:28,986 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 304 flow
[2022-11-21 16:31:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:28,987 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:28,988 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:28,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-21 16:31:28,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 682131982, now seen corresponding path program 1 times
[2022-11-21 16:31:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:28,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550842507]
[2022-11-21 16:31:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550842507]
[2022-11-21 16:31:29,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550842507] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:29,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:29,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:31:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485585805]
[2022-11-21 16:31:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:29,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-21 16:31:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-21 16:31:29,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-11-21 16:31:29,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 153
[2022-11-21 16:31:29,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:29,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:29,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 153
[2022-11-21 16:31:29,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:30,449 INFO L130 PetriNetUnfolder]: 719/1513 cut-off events.
[2022-11-21 16:31:30,449 INFO L131 PetriNetUnfolder]: For 512/521 co-relation queries the response was YES.
[2022-11-21 16:31:30,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 1513 events. 719/1513 cut-off events. For 512/521 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8411 event pairs, 267 based on Foata normal form. 36/1492 useless extension candidates. Maximal degree in co-relation 2955. Up to 549 conditions per place.
[2022-11-21 16:31:30,460 INFO L137 encePairwiseOnDemand]: 146/153 looper letters, 22 selfloop transitions, 3 changer transitions 37/174 dead transitions.
[2022-11-21 16:31:30,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 538 flow
[2022-11-21 16:31:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-21 16:31:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-21 16:31:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1354 transitions.
[2022-11-21 16:31:30,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8849673202614379
[2022-11-21 16:31:30,465 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1354 transitions.
[2022-11-21 16:31:30,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1354 transitions.
[2022-11-21 16:31:30,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:30,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1354 transitions.
[2022-11-21 16:31:30,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.4) internal successors, (1354), 10 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:30,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:30,479 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:30,479 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 304 flow. Second operand 10 states and 1354 transitions.
[2022-11-21 16:31:30,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 174 transitions, 538 flow
[2022-11-21 16:31:30,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 174 transitions, 492 flow, removed 18 selfloop flow, removed 10 redundant places.
[2022-11-21 16:31:30,496 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 300 flow
[2022-11-21 16:31:30,496 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=300, PETRI_PLACES=158, PETRI_TRANSITIONS=131}
[2022-11-21 16:31:30,498 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -2 predicate places.
[2022-11-21 16:31:30,499 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 300 flow
[2022-11-21 16:31:30,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:30,499 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:30,500 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:30,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-21 16:31:30,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1885574655, now seen corresponding path program 1 times
[2022-11-21 16:31:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:30,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969944417]
[2022-11-21 16:31:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969944417]
[2022-11-21 16:31:31,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969944417] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:31,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:31,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-21 16:31:31,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043613610]
[2022-11-21 16:31:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:31,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-21 16:31:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-21 16:31:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-21 16:31:31,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153
[2022-11-21 16:31:31,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:31,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:31,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153
[2022-11-21 16:31:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:33,611 INFO L130 PetriNetUnfolder]: 4273/7418 cut-off events.
[2022-11-21 16:31:33,612 INFO L131 PetriNetUnfolder]: For 725/725 co-relation queries the response was YES.
[2022-11-21 16:31:33,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14934 conditions, 7418 events. 4273/7418 cut-off events. For 725/725 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 51788 event pairs, 214 based on Foata normal form. 0/7269 useless extension candidates. Maximal degree in co-relation 14848. Up to 2518 conditions per place.
[2022-11-21 16:31:33,662 INFO L137 encePairwiseOnDemand]: 142/153 looper letters, 38 selfloop transitions, 7 changer transitions 60/212 dead transitions.
[2022-11-21 16:31:33,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 212 transitions, 697 flow
[2022-11-21 16:31:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-21 16:31:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-21 16:31:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1357 transitions.
[2022-11-21 16:31:33,666 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8869281045751634
[2022-11-21 16:31:33,667 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1357 transitions.
[2022-11-21 16:31:33,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1357 transitions.
[2022-11-21 16:31:33,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:33,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1357 transitions.
[2022-11-21 16:31:33,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:33,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:33,674 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:33,675 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 300 flow. Second operand 10 states and 1357 transitions.
[2022-11-21 16:31:33,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 212 transitions, 697 flow
[2022-11-21 16:31:33,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 212 transitions, 665 flow, removed 6 selfloop flow, removed 9 redundant places.
[2022-11-21 16:31:33,692 INFO L231 Difference]: Finished difference. Result has 158 places, 134 transitions, 348 flow
[2022-11-21 16:31:33,692 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=348, PETRI_PLACES=158, PETRI_TRANSITIONS=134}
[2022-11-21 16:31:33,694 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -2 predicate places.
[2022-11-21 16:31:33,695 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 348 flow
[2022-11-21 16:31:33,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:33,695 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:33,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:33,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-21 16:31:33,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1475587328, now seen corresponding path program 1 times
[2022-11-21 16:31:33,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:33,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696521020]
[2022-11-21 16:31:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:34,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696521020]
[2022-11-21 16:31:34,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696521020] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:34,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:34,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:31:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492733665]
[2022-11-21 16:31:34,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:34,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-21 16:31:34,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-21 16:31:34,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-11-21 16:31:34,208 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153
[2022-11-21 16:31:34,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:34,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:34,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153
[2022-11-21 16:31:34,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:35,488 INFO L130 PetriNetUnfolder]: 1873/3624 cut-off events.
[2022-11-21 16:31:35,488 INFO L131 PetriNetUnfolder]: For 4067/4161 co-relation queries the response was YES.
[2022-11-21 16:31:35,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10149 conditions, 3624 events. 1873/3624 cut-off events. For 4067/4161 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24158 event pairs, 65 based on Foata normal form. 108/3706 useless extension candidates. Maximal degree in co-relation 10063. Up to 1001 conditions per place.
[2022-11-21 16:31:35,526 INFO L137 encePairwiseOnDemand]: 143/153 looper letters, 45 selfloop transitions, 11 changer transitions 47/210 dead transitions.
[2022-11-21 16:31:35,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 210 transitions, 882 flow
[2022-11-21 16:31:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-21 16:31:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-21 16:31:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1355 transitions.
[2022-11-21 16:31:35,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8856209150326797
[2022-11-21 16:31:35,530 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1355 transitions.
[2022-11-21 16:31:35,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1355 transitions.
[2022-11-21 16:31:35,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:35,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1355 transitions.
[2022-11-21 16:31:35,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.5) internal successors, (1355), 10 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:35,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:35,538 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:35,539 INFO L175 Difference]: Start difference. First operand has 158 places, 134 transitions, 348 flow. Second operand 10 states and 1355 transitions.
[2022-11-21 16:31:35,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 210 transitions, 882 flow
[2022-11-21 16:31:35,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 210 transitions, 857 flow, removed 7 selfloop flow, removed 5 redundant places.
[2022-11-21 16:31:35,557 INFO L231 Difference]: Finished difference. Result has 162 places, 138 transitions, 436 flow
[2022-11-21 16:31:35,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=162, PETRI_TRANSITIONS=138}
[2022-11-21 16:31:35,560 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places.
[2022-11-21 16:31:35,561 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 138 transitions, 436 flow
[2022-11-21 16:31:35,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:35,562 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:35,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:35,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-21 16:31:35,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash -839593617, now seen corresponding path program 1 times
[2022-11-21 16:31:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:35,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991337700]
[2022-11-21 16:31:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991337700]
[2022-11-21 16:31:38,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991337700] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:38,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:38,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-11-21 16:31:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350488555]
[2022-11-21 16:31:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:38,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-11-21 16:31:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-11-21 16:31:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182
[2022-11-21 16:31:38,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 153
[2022-11-21 16:31:38,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 138 transitions, 436 flow. Second operand has 14 states, 14 states have (on average 117.14285714285714) internal successors, (1640), 14 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:38,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:38,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 153
[2022-11-21 16:31:38,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:39,606 INFO L130 PetriNetUnfolder]: 532/1679 cut-off events.
[2022-11-21 16:31:39,606 INFO L131 PetriNetUnfolder]: For 2648/2785 co-relation queries the response was YES.
[2022-11-21 16:31:39,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4392 conditions, 1679 events. 532/1679 cut-off events. For 2648/2785 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 11584 event pairs, 260 based on Foata normal form. 23/1657 useless extension candidates. Maximal degree in co-relation 4290. Up to 511 conditions per place.
[2022-11-21 16:31:39,626 INFO L137 encePairwiseOnDemand]: 139/153 looper letters, 51 selfloop transitions, 14 changer transitions 35/205 dead transitions.
[2022-11-21 16:31:39,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 205 transitions, 792 flow
[2022-11-21 16:31:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-11-21 16:31:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2022-11-21 16:31:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2634 transitions.
[2022-11-21 16:31:39,633 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7825311942959001
[2022-11-21 16:31:39,633 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2634 transitions.
[2022-11-21 16:31:39,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2634 transitions.
[2022-11-21 16:31:39,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:39,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2634 transitions.
[2022-11-21 16:31:39,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 119.72727272727273) internal successors, (2634), 22 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:39,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:39,649 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:39,650 INFO L175 Difference]: Start difference. First operand has 162 places, 138 transitions, 436 flow. Second operand 22 states and 2634 transitions.
[2022-11-21 16:31:39,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 205 transitions, 792 flow
[2022-11-21 16:31:39,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 205 transitions, 723 flow, removed 25 selfloop flow, removed 9 redundant places.
[2022-11-21 16:31:39,663 INFO L231 Difference]: Finished difference. Result has 186 places, 147 transitions, 473 flow
[2022-11-21 16:31:39,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=473, PETRI_PLACES=186, PETRI_TRANSITIONS=147}
[2022-11-21 16:31:39,664 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 26 predicate places.
[2022-11-21 16:31:39,665 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 147 transitions, 473 flow
[2022-11-21 16:31:39,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 117.14285714285714) internal successors, (1640), 14 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:39,666 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:39,666 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-21 16:31:39,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1229673003, now seen corresponding path program 2 times
[2022-11-21 16:31:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153525476]
[2022-11-21 16:31:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:42,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153525476]
[2022-11-21 16:31:42,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153525476] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:42,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:42,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-11-21 16:31:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878881546]
[2022-11-21 16:31:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:42,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-11-21 16:31:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-11-21 16:31:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240
[2022-11-21 16:31:42,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 153
[2022-11-21 16:31:42,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 147 transitions, 473 flow. Second operand has 16 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:42,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:42,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 153
[2022-11-21 16:31:42,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:44,077 INFO L130 PetriNetUnfolder]: 573/1765 cut-off events.
[2022-11-21 16:31:44,077 INFO L131 PetriNetUnfolder]: For 3183/3245 co-relation queries the response was YES.
[2022-11-21 16:31:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1765 events. 573/1765 cut-off events. For 3183/3245 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 12327 event pairs, 279 based on Foata normal form. 24/1740 useless extension candidates. Maximal degree in co-relation 5024. Up to 551 conditions per place.
[2022-11-21 16:31:44,094 INFO L137 encePairwiseOnDemand]: 136/153 looper letters, 52 selfloop transitions, 27 changer transitions 35/216 dead transitions.
[2022-11-21 16:31:44,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 216 transitions, 1090 flow
[2022-11-21 16:31:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-11-21 16:31:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2022-11-21 16:31:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2911 transitions.
[2022-11-21 16:31:44,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7610457516339869
[2022-11-21 16:31:44,102 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2911 transitions.
[2022-11-21 16:31:44,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2911 transitions.
[2022-11-21 16:31:44,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:44,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2911 transitions.
[2022-11-21 16:31:44,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 116.44) internal successors, (2911), 25 states have internal predecessors, (2911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:44,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 153.0) internal successors, (3978), 26 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:44,125 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 153.0) internal successors, (3978), 26 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:44,125 INFO L175 Difference]: Start difference. First operand has 186 places, 147 transitions, 473 flow. Second operand 25 states and 2911 transitions.
[2022-11-21 16:31:44,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 216 transitions, 1090 flow
[2022-11-21 16:31:44,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 216 transitions, 999 flow, removed 42 selfloop flow, removed 13 redundant places.
[2022-11-21 16:31:44,139 INFO L231 Difference]: Finished difference. Result has 202 places, 160 transitions, 653 flow
[2022-11-21 16:31:44,139 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=653, PETRI_PLACES=202, PETRI_TRANSITIONS=160}
[2022-11-21 16:31:44,140 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 42 predicate places.
[2022-11-21 16:31:44,140 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 160 transitions, 653 flow
[2022-11-21 16:31:44,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:44,141 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:44,142 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:44,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-21 16:31:44,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1816497485, now seen corresponding path program 3 times
[2022-11-21 16:31:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:44,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180631024]
[2022-11-21 16:31:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180631024]
[2022-11-21 16:31:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180631024] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:49,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2022-11-21 16:31:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228887539]
[2022-11-21 16:31:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:49,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2022-11-21 16:31:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2022-11-21 16:31:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600
[2022-11-21 16:31:49,254 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153
[2022-11-21 16:31:49,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 160 transitions, 653 flow. Second operand has 25 states, 25 states have (on average 94.76) internal successors, (2369), 25 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:49,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:49,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153
[2022-11-21 16:31:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:51,994 INFO L130 PetriNetUnfolder]: 769/2398 cut-off events.
[2022-11-21 16:31:51,994 INFO L131 PetriNetUnfolder]: For 7522/7627 co-relation queries the response was YES.
[2022-11-21 16:31:52,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8178 conditions, 2398 events. 769/2398 cut-off events. For 7522/7627 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 18352 event pairs, 302 based on Foata normal form. 46/2382 useless extension candidates. Maximal degree in co-relation 8039. Up to 788 conditions per place.
[2022-11-21 16:31:52,021 INFO L137 encePairwiseOnDemand]: 128/153 looper letters, 87 selfloop transitions, 59 changer transitions 15/252 dead transitions.
[2022-11-21 16:31:52,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 252 transitions, 1687 flow
[2022-11-21 16:31:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2022-11-21 16:31:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2022-11-21 16:31:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2918 transitions.
[2022-11-21 16:31:52,032 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6357298474945534
[2022-11-21 16:31:52,033 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2918 transitions.
[2022-11-21 16:31:52,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2918 transitions.
[2022-11-21 16:31:52,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:52,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2918 transitions.
[2022-11-21 16:31:52,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 97.26666666666667) internal successors, (2918), 30 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:52,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:52,055 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:52,056 INFO L175 Difference]: Start difference. First operand has 202 places, 160 transitions, 653 flow. Second operand 30 states and 2918 transitions.
[2022-11-21 16:31:52,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 252 transitions, 1687 flow
[2022-11-21 16:31:52,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 252 transitions, 1550 flow, removed 63 selfloop flow, removed 15 redundant places.
[2022-11-21 16:31:52,085 INFO L231 Difference]: Finished difference. Result has 216 places, 206 transitions, 1194 flow
[2022-11-21 16:31:52,086 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1194, PETRI_PLACES=216, PETRI_TRANSITIONS=206}
[2022-11-21 16:31:52,087 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 56 predicate places.
[2022-11-21 16:31:52,087 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 206 transitions, 1194 flow
[2022-11-21 16:31:52,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 94.76) internal successors, (2369), 25 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:52,090 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:52,090 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:52,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-21 16:31:52,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1503305855, now seen corresponding path program 4 times
[2022-11-21 16:31:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:52,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688200733]
[2022-11-21 16:31:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:56,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688200733]
[2022-11-21 16:31:56,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688200733] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:56,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:56,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2022-11-21 16:31:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918799519]
[2022-11-21 16:31:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:56,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-11-21 16:31:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:56,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-11-21 16:31:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650
[2022-11-21 16:31:56,501 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153
[2022-11-21 16:31:56,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 206 transitions, 1194 flow. Second operand has 26 states, 26 states have (on average 94.6923076923077) internal successors, (2462), 26 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:56,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:56,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153
[2022-11-21 16:31:56,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:31:58,665 INFO L130 PetriNetUnfolder]: 781/2382 cut-off events.
[2022-11-21 16:31:58,665 INFO L131 PetriNetUnfolder]: For 8540/8629 co-relation queries the response was YES.
[2022-11-21 16:31:58,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8645 conditions, 2382 events. 781/2382 cut-off events. For 8540/8629 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 18093 event pairs, 327 based on Foata normal form. 44/2365 useless extension candidates. Maximal degree in co-relation 8496. Up to 992 conditions per place.
[2022-11-21 16:31:58,693 INFO L137 encePairwiseOnDemand]: 125/153 looper letters, 89 selfloop transitions, 52 changer transitions 48/280 dead transitions.
[2022-11-21 16:31:58,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 280 transitions, 2321 flow
[2022-11-21 16:31:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2022-11-21 16:31:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2022-11-21 16:31:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3088 transitions.
[2022-11-21 16:31:58,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.630718954248366
[2022-11-21 16:31:58,701 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3088 transitions.
[2022-11-21 16:31:58,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3088 transitions.
[2022-11-21 16:31:58,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:31:58,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3088 transitions.
[2022-11-21 16:31:58,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 96.5) internal successors, (3088), 32 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:58,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 153.0) internal successors, (5049), 33 states have internal predecessors, (5049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:58,721 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 153.0) internal successors, (5049), 33 states have internal predecessors, (5049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:58,721 INFO L175 Difference]: Start difference. First operand has 216 places, 206 transitions, 1194 flow. Second operand 32 states and 3088 transitions.
[2022-11-21 16:31:58,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 280 transitions, 2321 flow
[2022-11-21 16:31:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 280 transitions, 2043 flow, removed 127 selfloop flow, removed 12 redundant places.
[2022-11-21 16:31:58,765 INFO L231 Difference]: Finished difference. Result has 249 places, 227 transitions, 1433 flow
[2022-11-21 16:31:58,766 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1433, PETRI_PLACES=249, PETRI_TRANSITIONS=227}
[2022-11-21 16:31:58,767 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 89 predicate places.
[2022-11-21 16:31:58,767 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 227 transitions, 1433 flow
[2022-11-21 16:31:58,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 94.6923076923077) internal successors, (2462), 26 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:58,768 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:31:58,769 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:31:58,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-11-21 16:31:58,769 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:31:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:31:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2118144619, now seen corresponding path program 1 times
[2022-11-21 16:31:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:31:58,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234321496]
[2022-11-21 16:31:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:31:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:31:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:31:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:31:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:31:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234321496]
[2022-11-21 16:31:59,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234321496] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:31:59,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:31:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-11-21 16:31:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405232701]
[2022-11-21 16:31:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:31:59,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-11-21 16:31:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:31:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-11-21 16:31:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-11-21 16:31:59,129 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153
[2022-11-21 16:31:59,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 227 transitions, 1433 flow. Second operand has 8 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:31:59,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:31:59,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153
[2022-11-21 16:31:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:00,315 INFO L130 PetriNetUnfolder]: 1188/2667 cut-off events.
[2022-11-21 16:32:00,315 INFO L131 PetriNetUnfolder]: For 15947/16053 co-relation queries the response was YES.
[2022-11-21 16:32:00,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11698 conditions, 2667 events. 1188/2667 cut-off events. For 15947/16053 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17868 event pairs, 61 based on Foata normal form. 84/2724 useless extension candidates. Maximal degree in co-relation 11557. Up to 548 conditions per place.
[2022-11-21 16:32:00,340 INFO L137 encePairwiseOnDemand]: 143/153 looper letters, 182 selfloop transitions, 15 changer transitions 107/426 dead transitions.
[2022-11-21 16:32:00,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 426 transitions, 4119 flow
[2022-11-21 16:32:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-11-21 16:32:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2022-11-21 16:32:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1490 transitions.
[2022-11-21 16:32:00,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8853238265002971
[2022-11-21 16:32:00,345 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1490 transitions.
[2022-11-21 16:32:00,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1490 transitions.
[2022-11-21 16:32:00,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:00,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1490 transitions.
[2022-11-21 16:32:00,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.45454545454547) internal successors, (1490), 11 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,353 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,354 INFO L175 Difference]: Start difference. First operand has 249 places, 227 transitions, 1433 flow. Second operand 11 states and 1490 transitions.
[2022-11-21 16:32:00,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 426 transitions, 4119 flow
[2022-11-21 16:32:00,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 426 transitions, 3836 flow, removed 106 selfloop flow, removed 22 redundant places.
[2022-11-21 16:32:00,404 INFO L231 Difference]: Finished difference. Result has 232 places, 216 transitions, 1309 flow
[2022-11-21 16:32:00,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1309, PETRI_PLACES=232, PETRI_TRANSITIONS=216}
[2022-11-21 16:32:00,405 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 72 predicate places.
[2022-11-21 16:32:00,405 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 216 transitions, 1309 flow
[2022-11-21 16:32:00,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,405 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:00,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:00,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-11-21 16:32:00,406 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash -630837460, now seen corresponding path program 1 times
[2022-11-21 16:32:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:00,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762918110]
[2022-11-21 16:32:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762918110]
[2022-11-21 16:32:00,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762918110] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:00,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:00,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-21 16:32:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499445560]
[2022-11-21 16:32:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:00,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-21 16:32:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-21 16:32:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-21 16:32:00,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 153
[2022-11-21 16:32:00,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 216 transitions, 1309 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:00,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:00,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 153
[2022-11-21 16:32:00,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:01,511 INFO L130 PetriNetUnfolder]: 727/2249 cut-off events.
[2022-11-21 16:32:01,511 INFO L131 PetriNetUnfolder]: For 10339/10575 co-relation queries the response was YES.
[2022-11-21 16:32:01,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8782 conditions, 2249 events. 727/2249 cut-off events. For 10339/10575 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17049 event pairs, 100 based on Foata normal form. 82/2283 useless extension candidates. Maximal degree in co-relation 8652. Up to 485 conditions per place.
[2022-11-21 16:32:01,533 INFO L137 encePairwiseOnDemand]: 147/153 looper letters, 139 selfloop transitions, 2 changer transitions 23/299 dead transitions.
[2022-11-21 16:32:01,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 299 transitions, 2484 flow
[2022-11-21 16:32:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-11-21 16:32:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2022-11-21 16:32:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions.
[2022-11-21 16:32:01,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8776844070961718
[2022-11-21 16:32:01,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions.
[2022-11-21 16:32:01,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions.
[2022-11-21 16:32:01,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:01,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions.
[2022-11-21 16:32:01,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:01,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:01,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:01,542 INFO L175 Difference]: Start difference. First operand has 232 places, 216 transitions, 1309 flow. Second operand 7 states and 940 transitions.
[2022-11-21 16:32:01,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 299 transitions, 2484 flow
[2022-11-21 16:32:01,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 299 transitions, 2315 flow, removed 71 selfloop flow, removed 19 redundant places.
[2022-11-21 16:32:01,592 INFO L231 Difference]: Finished difference. Result has 214 places, 217 transitions, 1219 flow
[2022-11-21 16:32:01,592 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1219, PETRI_PLACES=214, PETRI_TRANSITIONS=217}
[2022-11-21 16:32:01,593 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 54 predicate places.
[2022-11-21 16:32:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 217 transitions, 1219 flow
[2022-11-21 16:32:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:01,594 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:01,594 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:01,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-11-21 16:32:01,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1665341626, now seen corresponding path program 2 times
[2022-11-21 16:32:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549815161]
[2022-11-21 16:32:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549815161]
[2022-11-21 16:32:05,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549815161] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:05,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:05,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2022-11-21 16:32:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522606408]
[2022-11-21 16:32:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:05,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-11-21 16:32:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-11-21 16:32:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650
[2022-11-21 16:32:05,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153
[2022-11-21 16:32:05,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 217 transitions, 1219 flow. Second operand has 26 states, 26 states have (on average 93.76923076923077) internal successors, (2438), 26 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:05,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:05,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153
[2022-11-21 16:32:05,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:08,050 INFO L130 PetriNetUnfolder]: 583/2233 cut-off events.
[2022-11-21 16:32:08,050 INFO L131 PetriNetUnfolder]: For 6153/6465 co-relation queries the response was YES.
[2022-11-21 16:32:08,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 2233 events. 583/2233 cut-off events. For 6153/6465 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18791 event pairs, 139 based on Foata normal form. 107/2276 useless extension candidates. Maximal degree in co-relation 7020. Up to 520 conditions per place.
[2022-11-21 16:32:08,067 INFO L137 encePairwiseOnDemand]: 128/153 looper letters, 88 selfloop transitions, 74 changer transitions 14/271 dead transitions.
[2022-11-21 16:32:08,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 271 transitions, 2090 flow
[2022-11-21 16:32:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2022-11-21 16:32:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2022-11-21 16:32:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2875 transitions.
[2022-11-21 16:32:08,073 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6263616557734205
[2022-11-21 16:32:08,074 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2875 transitions.
[2022-11-21 16:32:08,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2875 transitions.
[2022-11-21 16:32:08,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:08,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2875 transitions.
[2022-11-21 16:32:08,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 95.83333333333333) internal successors, (2875), 30 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:08,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:08,089 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:08,090 INFO L175 Difference]: Start difference. First operand has 214 places, 217 transitions, 1219 flow. Second operand 30 states and 2875 transitions.
[2022-11-21 16:32:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 271 transitions, 2090 flow
[2022-11-21 16:32:08,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 271 transitions, 2069 flow, removed 10 selfloop flow, removed 4 redundant places.
[2022-11-21 16:32:08,126 INFO L231 Difference]: Finished difference. Result has 247 places, 238 transitions, 1699 flow
[2022-11-21 16:32:08,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1699, PETRI_PLACES=247, PETRI_TRANSITIONS=238}
[2022-11-21 16:32:08,127 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 87 predicate places.
[2022-11-21 16:32:08,127 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 1699 flow
[2022-11-21 16:32:08,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 93.76923076923077) internal successors, (2438), 26 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:08,128 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:08,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:08,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-11-21 16:32:08,129 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash -321618442, now seen corresponding path program 3 times
[2022-11-21 16:32:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:08,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596464706]
[2022-11-21 16:32:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:08,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596464706]
[2022-11-21 16:32:11,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596464706] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:11,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:11,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-11-21 16:32:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329048396]
[2022-11-21 16:32:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:11,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-11-21 16:32:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-11-21 16:32:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552
[2022-11-21 16:32:11,320 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153
[2022-11-21 16:32:11,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 1699 flow. Second operand has 24 states, 24 states have (on average 96.79166666666667) internal successors, (2323), 24 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:11,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:11,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153
[2022-11-21 16:32:11,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:13,003 INFO L130 PetriNetUnfolder]: 604/2338 cut-off events.
[2022-11-21 16:32:13,003 INFO L131 PetriNetUnfolder]: For 8372/8611 co-relation queries the response was YES.
[2022-11-21 16:32:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8108 conditions, 2338 events. 604/2338 cut-off events. For 8372/8611 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20258 event pairs, 154 based on Foata normal form. 100/2371 useless extension candidates. Maximal degree in co-relation 7949. Up to 694 conditions per place.
[2022-11-21 16:32:13,026 INFO L137 encePairwiseOnDemand]: 128/153 looper letters, 113 selfloop transitions, 52 changer transitions 17/280 dead transitions.
[2022-11-21 16:32:13,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 280 transitions, 2525 flow
[2022-11-21 16:32:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2022-11-21 16:32:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2022-11-21 16:32:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2852 transitions.
[2022-11-21 16:32:13,032 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6427766508902412
[2022-11-21 16:32:13,032 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2852 transitions.
[2022-11-21 16:32:13,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2852 transitions.
[2022-11-21 16:32:13,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:13,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2852 transitions.
[2022-11-21 16:32:13,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 98.34482758620689) internal successors, (2852), 29 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:13,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 153.0) internal successors, (4590), 30 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:13,047 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 153.0) internal successors, (4590), 30 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:13,047 INFO L175 Difference]: Start difference. First operand has 247 places, 238 transitions, 1699 flow. Second operand 29 states and 2852 transitions.
[2022-11-21 16:32:13,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 280 transitions, 2525 flow
[2022-11-21 16:32:13,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 280 transitions, 2351 flow, removed 62 selfloop flow, removed 22 redundant places.
[2022-11-21 16:32:13,096 INFO L231 Difference]: Finished difference. Result has 259 places, 259 transitions, 1981 flow
[2022-11-21 16:32:13,096 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1981, PETRI_PLACES=259, PETRI_TRANSITIONS=259}
[2022-11-21 16:32:13,097 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 99 predicate places.
[2022-11-21 16:32:13,097 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 259 transitions, 1981 flow
[2022-11-21 16:32:13,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 96.79166666666667) internal successors, (2323), 24 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:13,098 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:13,099 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:13,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-11-21 16:32:13,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1835965742, now seen corresponding path program 4 times
[2022-11-21 16:32:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:13,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337152938]
[2022-11-21 16:32:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337152938]
[2022-11-21 16:32:16,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337152938] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:16,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:16,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2022-11-21 16:32:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895032027]
[2022-11-21 16:32:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:16,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2022-11-21 16:32:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2022-11-21 16:32:16,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600
[2022-11-21 16:32:16,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153
[2022-11-21 16:32:16,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 259 transitions, 1981 flow. Second operand has 25 states, 25 states have (on average 96.72) internal successors, (2418), 25 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:16,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:16,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153
[2022-11-21 16:32:16,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:17,743 INFO L130 PetriNetUnfolder]: 609/2378 cut-off events.
[2022-11-21 16:32:17,743 INFO L131 PetriNetUnfolder]: For 9423/9684 co-relation queries the response was YES.
[2022-11-21 16:32:17,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8472 conditions, 2378 events. 609/2378 cut-off events. For 9423/9684 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20776 event pairs, 152 based on Foata normal form. 102/2408 useless extension candidates. Maximal degree in co-relation 8308. Up to 683 conditions per place.
[2022-11-21 16:32:17,763 INFO L137 encePairwiseOnDemand]: 127/153 looper letters, 110 selfloop transitions, 60 changer transitions 17/285 dead transitions.
[2022-11-21 16:32:17,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 2726 flow
[2022-11-21 16:32:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2022-11-21 16:32:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2022-11-21 16:32:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2945 transitions.
[2022-11-21 16:32:17,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6416122004357299
[2022-11-21 16:32:17,768 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2945 transitions.
[2022-11-21 16:32:17,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2945 transitions.
[2022-11-21 16:32:17,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:17,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2945 transitions.
[2022-11-21 16:32:17,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 98.16666666666667) internal successors, (2945), 30 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:17,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:17,783 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:17,783 INFO L175 Difference]: Start difference. First operand has 259 places, 259 transitions, 1981 flow. Second operand 30 states and 2945 transitions.
[2022-11-21 16:32:17,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 2726 flow
[2022-11-21 16:32:17,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 285 transitions, 2592 flow, removed 48 selfloop flow, removed 18 redundant places.
[2022-11-21 16:32:17,836 INFO L231 Difference]: Finished difference. Result has 272 places, 265 transitions, 2175 flow
[2022-11-21 16:32:17,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2175, PETRI_PLACES=272, PETRI_TRANSITIONS=265}
[2022-11-21 16:32:17,838 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 112 predicate places.
[2022-11-21 16:32:17,838 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 265 transitions, 2175 flow
[2022-11-21 16:32:17,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 96.72) internal successors, (2418), 25 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:17,839 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:17,839 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:17,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-11-21 16:32:17,839 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1711743810, now seen corresponding path program 5 times
[2022-11-21 16:32:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:17,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312297242]
[2022-11-21 16:32:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:22,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:22,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312297242]
[2022-11-21 16:32:22,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312297242] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:22,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:22,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-11-21 16:32:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090703389]
[2022-11-21 16:32:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:22,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-11-21 16:32:22,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-11-21 16:32:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702
[2022-11-21 16:32:22,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153
[2022-11-21 16:32:22,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 265 transitions, 2175 flow. Second operand has 27 states, 27 states have (on average 94.66666666666667) internal successors, (2556), 27 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:22,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:22,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153
[2022-11-21 16:32:22,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:25,000 INFO L130 PetriNetUnfolder]: 663/2616 cut-off events.
[2022-11-21 16:32:25,000 INFO L131 PetriNetUnfolder]: For 11923/12202 co-relation queries the response was YES.
[2022-11-21 16:32:25,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9595 conditions, 2616 events. 663/2616 cut-off events. For 11923/12202 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23720 event pairs, 146 based on Foata normal form. 121/2662 useless extension candidates. Maximal degree in co-relation 9422. Up to 639 conditions per place.
[2022-11-21 16:32:25,020 INFO L137 encePairwiseOnDemand]: 124/153 looper letters, 108 selfloop transitions, 79 changer transitions 20/303 dead transitions.
[2022-11-21 16:32:25,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 303 transitions, 3106 flow
[2022-11-21 16:32:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2022-11-21 16:32:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2022-11-21 16:32:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3456 transitions.
[2022-11-21 16:32:25,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569
[2022-11-21 16:32:25,025 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3456 transitions.
[2022-11-21 16:32:25,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3456 transitions.
[2022-11-21 16:32:25,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:25,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3456 transitions.
[2022-11-21 16:32:25,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 96.0) internal successors, (3456), 36 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:25,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 153.0) internal successors, (5661), 37 states have internal predecessors, (5661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:25,041 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 153.0) internal successors, (5661), 37 states have internal predecessors, (5661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:25,042 INFO L175 Difference]: Start difference. First operand has 272 places, 265 transitions, 2175 flow. Second operand 36 states and 3456 transitions.
[2022-11-21 16:32:25,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 303 transitions, 3106 flow
[2022-11-21 16:32:25,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 303 transitions, 2899 flow, removed 62 selfloop flow, removed 25 redundant places.
[2022-11-21 16:32:25,106 INFO L231 Difference]: Finished difference. Result has 285 places, 274 transitions, 2409 flow
[2022-11-21 16:32:25,106 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2409, PETRI_PLACES=285, PETRI_TRANSITIONS=274}
[2022-11-21 16:32:25,107 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 125 predicate places.
[2022-11-21 16:32:25,107 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 274 transitions, 2409 flow
[2022-11-21 16:32:25,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 94.66666666666667) internal successors, (2556), 27 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:25,108 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:25,108 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:25,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-11-21 16:32:25,109 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash -14429688, now seen corresponding path program 6 times
[2022-11-21 16:32:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:25,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350199942]
[2022-11-21 16:32:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:27,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350199942]
[2022-11-21 16:32:27,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350199942] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:27,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:27,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-11-21 16:32:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11340789]
[2022-11-21 16:32:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:27,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-11-21 16:32:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-11-21 16:32:27,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342
[2022-11-21 16:32:27,450 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 153
[2022-11-21 16:32:27,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 274 transitions, 2409 flow. Second operand has 19 states, 19 states have (on average 111.89473684210526) internal successors, (2126), 19 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:27,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:27,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 153
[2022-11-21 16:32:27,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:29,313 INFO L130 PetriNetUnfolder]: 684/2711 cut-off events.
[2022-11-21 16:32:29,313 INFO L131 PetriNetUnfolder]: For 14019/14493 co-relation queries the response was YES.
[2022-11-21 16:32:29,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10237 conditions, 2711 events. 684/2711 cut-off events. For 14019/14493 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25035 event pairs, 129 based on Foata normal form. 181/2821 useless extension candidates. Maximal degree in co-relation 10065. Up to 589 conditions per place.
[2022-11-21 16:32:29,343 INFO L137 encePairwiseOnDemand]: 133/153 looper letters, 114 selfloop transitions, 75 changer transitions 22/322 dead transitions.
[2022-11-21 16:32:29,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 322 transitions, 3504 flow
[2022-11-21 16:32:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-11-21 16:32:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2022-11-21 16:32:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2729 transitions.
[2022-11-21 16:32:29,347 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7431917211328976
[2022-11-21 16:32:29,347 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2729 transitions.
[2022-11-21 16:32:29,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2729 transitions.
[2022-11-21 16:32:29,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:29,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2729 transitions.
[2022-11-21 16:32:29,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 113.70833333333333) internal successors, (2729), 24 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:29,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:29,360 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:29,360 INFO L175 Difference]: Start difference. First operand has 285 places, 274 transitions, 2409 flow. Second operand 24 states and 2729 transitions.
[2022-11-21 16:32:29,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 322 transitions, 3504 flow
[2022-11-21 16:32:29,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 322 transitions, 3251 flow, removed 100 selfloop flow, removed 27 redundant places.
[2022-11-21 16:32:29,432 INFO L231 Difference]: Finished difference. Result has 285 places, 290 transitions, 2707 flow
[2022-11-21 16:32:29,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2707, PETRI_PLACES=285, PETRI_TRANSITIONS=290}
[2022-11-21 16:32:29,434 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 125 predicate places.
[2022-11-21 16:32:29,434 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 290 transitions, 2707 flow
[2022-11-21 16:32:29,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 111.89473684210526) internal successors, (2126), 19 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:29,435 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:29,435 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:29,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-21 16:32:29,435 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1858041896, now seen corresponding path program 1 times
[2022-11-21 16:32:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:29,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290826373]
[2022-11-21 16:32:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:32,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290826373]
[2022-11-21 16:32:32,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290826373] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:32,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:32,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-11-21 16:32:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225950805]
[2022-11-21 16:32:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:32,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-11-21 16:32:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-11-21 16:32:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2022-11-21 16:32:32,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153
[2022-11-21 16:32:32,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 290 transitions, 2707 flow. Second operand has 17 states, 17 states have (on average 109.23529411764706) internal successors, (1857), 17 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:32,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:32,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153
[2022-11-21 16:32:32,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:36,869 INFO L130 PetriNetUnfolder]: 1292/5223 cut-off events.
[2022-11-21 16:32:36,869 INFO L131 PetriNetUnfolder]: For 27505/28380 co-relation queries the response was YES.
[2022-11-21 16:32:36,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19497 conditions, 5223 events. 1292/5223 cut-off events. For 27505/28380 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 55724 event pairs, 197 based on Foata normal form. 275/5349 useless extension candidates. Maximal degree in co-relation 19324. Up to 858 conditions per place.
[2022-11-21 16:32:36,945 INFO L137 encePairwiseOnDemand]: 137/153 looper letters, 174 selfloop transitions, 105 changer transitions 36/420 dead transitions.
[2022-11-21 16:32:36,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 420 transitions, 4965 flow
[2022-11-21 16:32:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2022-11-21 16:32:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2022-11-21 16:32:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3599 transitions.
[2022-11-21 16:32:36,951 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7350898692810458
[2022-11-21 16:32:36,952 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3599 transitions.
[2022-11-21 16:32:36,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3599 transitions.
[2022-11-21 16:32:36,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:36,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3599 transitions.
[2022-11-21 16:32:36,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 112.46875) internal successors, (3599), 32 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:36,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 153.0) internal successors, (5049), 33 states have internal predecessors, (5049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:36,970 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 153.0) internal successors, (5049), 33 states have internal predecessors, (5049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:36,970 INFO L175 Difference]: Start difference. First operand has 285 places, 290 transitions, 2707 flow. Second operand 32 states and 3599 transitions.
[2022-11-21 16:32:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 420 transitions, 4965 flow
[2022-11-21 16:32:37,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 420 transitions, 4542 flow, removed 204 selfloop flow, removed 23 redundant places.
[2022-11-21 16:32:37,168 INFO L231 Difference]: Finished difference. Result has 310 places, 313 transitions, 3303 flow
[2022-11-21 16:32:37,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2594, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3303, PETRI_PLACES=310, PETRI_TRANSITIONS=313}
[2022-11-21 16:32:37,169 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 150 predicate places.
[2022-11-21 16:32:37,170 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 313 transitions, 3303 flow
[2022-11-21 16:32:37,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 109.23529411764706) internal successors, (1857), 17 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:37,170 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:37,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:37,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-11-21 16:32:37,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1337039276, now seen corresponding path program 2 times
[2022-11-21 16:32:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:37,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255464003]
[2022-11-21 16:32:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255464003]
[2022-11-21 16:32:39,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255464003] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:39,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:39,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-11-21 16:32:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88831457]
[2022-11-21 16:32:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:39,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-11-21 16:32:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-11-21 16:32:39,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2022-11-21 16:32:39,319 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 153
[2022-11-21 16:32:39,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 313 transitions, 3303 flow. Second operand has 14 states, 14 states have (on average 114.5) internal successors, (1603), 14 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:39,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:39,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 153
[2022-11-21 16:32:39,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:41,148 INFO L130 PetriNetUnfolder]: 1520/6177 cut-off events.
[2022-11-21 16:32:41,148 INFO L131 PetriNetUnfolder]: For 39353/40544 co-relation queries the response was YES.
[2022-11-21 16:32:41,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23731 conditions, 6177 events. 1520/6177 cut-off events. For 39353/40544 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 68769 event pairs, 194 based on Foata normal form. 304/6267 useless extension candidates. Maximal degree in co-relation 23552. Up to 1095 conditions per place.
[2022-11-21 16:32:41,252 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 148 selfloop transitions, 103 changer transitions 16/381 dead transitions.
[2022-11-21 16:32:41,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 381 transitions, 4807 flow
[2022-11-21 16:32:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-11-21 16:32:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2022-11-21 16:32:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1776 transitions.
[2022-11-21 16:32:41,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7738562091503268
[2022-11-21 16:32:41,255 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1776 transitions.
[2022-11-21 16:32:41,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1776 transitions.
[2022-11-21 16:32:41,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:41,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1776 transitions.
[2022-11-21 16:32:41,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 118.4) internal successors, (1776), 15 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:41,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:41,262 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:41,262 INFO L175 Difference]: Start difference. First operand has 310 places, 313 transitions, 3303 flow. Second operand 15 states and 1776 transitions.
[2022-11-21 16:32:41,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 381 transitions, 4807 flow
[2022-11-21 16:32:41,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 381 transitions, 4478 flow, removed 161 selfloop flow, removed 19 redundant places.
[2022-11-21 16:32:41,612 INFO L231 Difference]: Finished difference. Result has 299 places, 331 transitions, 3773 flow
[2022-11-21 16:32:41,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3158, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3773, PETRI_PLACES=299, PETRI_TRANSITIONS=331}
[2022-11-21 16:32:41,613 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 139 predicate places.
[2022-11-21 16:32:41,614 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 331 transitions, 3773 flow
[2022-11-21 16:32:41,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 114.5) internal successors, (1603), 14 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:41,614 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:41,614 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:41,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-11-21 16:32:41,615 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash -35242172, now seen corresponding path program 3 times
[2022-11-21 16:32:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:41,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538523648]
[2022-11-21 16:32:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:41,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:41,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538523648]
[2022-11-21 16:32:41,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538523648] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:41,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:41,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-11-21 16:32:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698669837]
[2022-11-21 16:32:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:41,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-11-21 16:32:41,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-11-21 16:32:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-11-21 16:32:41,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153
[2022-11-21 16:32:41,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 331 transitions, 3773 flow. Second operand has 9 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:41,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:41,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153
[2022-11-21 16:32:41,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:44,937 INFO L130 PetriNetUnfolder]: 3813/10055 cut-off events.
[2022-11-21 16:32:44,937 INFO L131 PetriNetUnfolder]: For 100628/101213 co-relation queries the response was YES.
[2022-11-21 16:32:44,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48085 conditions, 10055 events. 3813/10055 cut-off events. For 100628/101213 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 107630 event pairs, 152 based on Foata normal form. 224/10213 useless extension candidates. Maximal degree in co-relation 47977. Up to 1927 conditions per place.
[2022-11-21 16:32:45,019 INFO L137 encePairwiseOnDemand]: 143/153 looper letters, 410 selfloop transitions, 19 changer transitions 170/730 dead transitions.
[2022-11-21 16:32:45,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 730 transitions, 11993 flow
[2022-11-21 16:32:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-11-21 16:32:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2022-11-21 16:32:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1585 transitions.
[2022-11-21 16:32:45,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8632897603485838
[2022-11-21 16:32:45,025 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1585 transitions.
[2022-11-21 16:32:45,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1585 transitions.
[2022-11-21 16:32:45,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:45,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1585 transitions.
[2022-11-21 16:32:45,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 132.08333333333334) internal successors, (1585), 12 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:45,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 153.0) internal successors, (1989), 13 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:45,032 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 153.0) internal successors, (1989), 13 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:45,033 INFO L175 Difference]: Start difference. First operand has 299 places, 331 transitions, 3773 flow. Second operand 12 states and 1585 transitions.
[2022-11-21 16:32:45,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 730 transitions, 11993 flow
[2022-11-21 16:32:45,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 730 transitions, 11148 flow, removed 290 selfloop flow, removed 15 redundant places.
[2022-11-21 16:32:45,433 INFO L231 Difference]: Finished difference. Result has 295 places, 309 transitions, 3260 flow
[2022-11-21 16:32:45,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3436, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3260, PETRI_PLACES=295, PETRI_TRANSITIONS=309}
[2022-11-21 16:32:45,434 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 135 predicate places.
[2022-11-21 16:32:45,434 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 309 transitions, 3260 flow
[2022-11-21 16:32:45,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:45,434 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:45,435 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:45,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-11-21 16:32:45,435 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash -349149667, now seen corresponding path program 1 times
[2022-11-21 16:32:45,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:45,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024590723]
[2022-11-21 16:32:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:50,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024590723]
[2022-11-21 16:32:50,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024590723] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:50,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:50,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-11-21 16:32:50,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368097938]
[2022-11-21 16:32:50,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:50,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-11-21 16:32:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-11-21 16:32:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306
[2022-11-21 16:32:50,636 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153
[2022-11-21 16:32:50,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 309 transitions, 3260 flow. Second operand has 18 states, 18 states have (on average 110.22222222222223) internal successors, (1984), 18 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:50,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:50,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153
[2022-11-21 16:32:50,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:53,502 INFO L130 PetriNetUnfolder]: 1235/5013 cut-off events.
[2022-11-21 16:32:53,502 INFO L131 PetriNetUnfolder]: For 19874/20986 co-relation queries the response was YES.
[2022-11-21 16:32:53,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18026 conditions, 5013 events. 1235/5013 cut-off events. For 19874/20986 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 57273 event pairs, 98 based on Foata normal form. 98/4914 useless extension candidates. Maximal degree in co-relation 17855. Up to 932 conditions per place.
[2022-11-21 16:32:53,542 INFO L137 encePairwiseOnDemand]: 137/153 looper letters, 140 selfloop transitions, 86 changer transitions 25/361 dead transitions.
[2022-11-21 16:32:53,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 361 transitions, 4164 flow
[2022-11-21 16:32:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-11-21 16:32:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2022-11-21 16:32:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2262 transitions.
[2022-11-21 16:32:53,547 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7392156862745098
[2022-11-21 16:32:53,547 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2262 transitions.
[2022-11-21 16:32:53,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2262 transitions.
[2022-11-21 16:32:53,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:53,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2262 transitions.
[2022-11-21 16:32:53,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.1) internal successors, (2262), 20 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:53,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:53,554 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:53,554 INFO L175 Difference]: Start difference. First operand has 295 places, 309 transitions, 3260 flow. Second operand 20 states and 2262 transitions.
[2022-11-21 16:32:53,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 361 transitions, 4164 flow
[2022-11-21 16:32:53,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 361 transitions, 3833 flow, removed 84 selfloop flow, removed 30 redundant places.
[2022-11-21 16:32:53,757 INFO L231 Difference]: Finished difference. Result has 286 places, 307 transitions, 3270 flow
[2022-11-21 16:32:53,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2963, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3270, PETRI_PLACES=286, PETRI_TRANSITIONS=307}
[2022-11-21 16:32:53,758 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 126 predicate places.
[2022-11-21 16:32:53,759 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 307 transitions, 3270 flow
[2022-11-21 16:32:53,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 110.22222222222223) internal successors, (1984), 18 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:53,759 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:53,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:53,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-11-21 16:32:53,760 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2046342877, now seen corresponding path program 2 times
[2022-11-21 16:32:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516751483]
[2022-11-21 16:32:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:32:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:32:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:32:56,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516751483]
[2022-11-21 16:32:56,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516751483] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:32:56,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:32:56,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-11-21 16:32:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739133036]
[2022-11-21 16:32:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:32:56,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-11-21 16:32:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:32:56,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-11-21 16:32:56,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380
[2022-11-21 16:32:56,207 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153
[2022-11-21 16:32:56,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 307 transitions, 3270 flow. Second operand has 20 states, 20 states have (on average 96.3) internal successors, (1926), 20 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:56,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:32:56,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153
[2022-11-21 16:32:56,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:32:58,795 INFO L130 PetriNetUnfolder]: 1502/6157 cut-off events.
[2022-11-21 16:32:58,795 INFO L131 PetriNetUnfolder]: For 17988/18646 co-relation queries the response was YES.
[2022-11-21 16:32:58,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16193 conditions, 6157 events. 1502/6157 cut-off events. For 17988/18646 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 73721 event pairs, 81 based on Foata normal form. 119/6049 useless extension candidates. Maximal degree in co-relation 16088. Up to 1004 conditions per place.
[2022-11-21 16:32:58,993 INFO L137 encePairwiseOnDemand]: 132/153 looper letters, 175 selfloop transitions, 100 changer transitions 18/390 dead transitions.
[2022-11-21 16:32:58,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 390 transitions, 4833 flow
[2022-11-21 16:32:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-11-21 16:32:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2022-11-21 16:32:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2179 transitions.
[2022-11-21 16:32:59,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6473559120617944
[2022-11-21 16:32:59,004 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2179 transitions.
[2022-11-21 16:32:59,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2179 transitions.
[2022-11-21 16:32:59,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:32:59,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2179 transitions.
[2022-11-21 16:32:59,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 99.04545454545455) internal successors, (2179), 22 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:59,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:59,013 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:59,013 INFO L175 Difference]: Start difference. First operand has 286 places, 307 transitions, 3270 flow. Second operand 22 states and 2179 transitions.
[2022-11-21 16:32:59,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 390 transitions, 4833 flow
[2022-11-21 16:32:59,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 390 transitions, 4625 flow, removed 58 selfloop flow, removed 17 redundant places.
[2022-11-21 16:32:59,104 INFO L231 Difference]: Finished difference. Result has 289 places, 337 transitions, 3935 flow
[2022-11-21 16:32:59,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3131, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3935, PETRI_PLACES=289, PETRI_TRANSITIONS=337}
[2022-11-21 16:32:59,105 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 129 predicate places.
[2022-11-21 16:32:59,105 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 337 transitions, 3935 flow
[2022-11-21 16:32:59,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.3) internal successors, (1926), 20 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:32:59,106 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:32:59,106 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:32:59,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-11-21 16:32:59,107 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:32:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:32:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1078139479, now seen corresponding path program 3 times
[2022-11-21 16:32:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:32:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679369850]
[2022-11-21 16:32:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:32:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:32:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:02,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:02,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679369850]
[2022-11-21 16:33:02,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679369850] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:02,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:02,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-11-21 16:33:02,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282249350]
[2022-11-21 16:33:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:02,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-11-21 16:33:02,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:02,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-11-21 16:33:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506
[2022-11-21 16:33:02,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153
[2022-11-21 16:33:02,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 337 transitions, 3935 flow. Second operand has 23 states, 23 states have (on average 93.17391304347827) internal successors, (2143), 23 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:02,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:02,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153
[2022-11-21 16:33:02,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:06,010 INFO L130 PetriNetUnfolder]: 1702/7070 cut-off events.
[2022-11-21 16:33:06,010 INFO L131 PetriNetUnfolder]: For 22022/22734 co-relation queries the response was YES.
[2022-11-21 16:33:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18607 conditions, 7070 events. 1702/7070 cut-off events. For 22022/22734 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 87388 event pairs, 118 based on Foata normal form. 148/6930 useless extension candidates. Maximal degree in co-relation 18501. Up to 1166 conditions per place.
[2022-11-21 16:33:06,081 INFO L137 encePairwiseOnDemand]: 134/153 looper letters, 158 selfloop transitions, 93 changer transitions 45/389 dead transitions.
[2022-11-21 16:33:06,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 389 transitions, 5029 flow
[2022-11-21 16:33:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-11-21 16:33:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2022-11-21 16:33:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1933 transitions.
[2022-11-21 16:33:06,084 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6316993464052287
[2022-11-21 16:33:06,084 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1933 transitions.
[2022-11-21 16:33:06,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1933 transitions.
[2022-11-21 16:33:06,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:06,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1933 transitions.
[2022-11-21 16:33:06,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 96.65) internal successors, (1933), 20 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:06,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:06,091 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:06,091 INFO L175 Difference]: Start difference. First operand has 289 places, 337 transitions, 3935 flow. Second operand 20 states and 1933 transitions.
[2022-11-21 16:33:06,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 389 transitions, 5029 flow
[2022-11-21 16:33:06,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 389 transitions, 4900 flow, removed 59 selfloop flow, removed 9 redundant places.
[2022-11-21 16:33:06,202 INFO L231 Difference]: Finished difference. Result has 303 places, 317 transitions, 3885 flow
[2022-11-21 16:33:06,202 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3826, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3885, PETRI_PLACES=303, PETRI_TRANSITIONS=317}
[2022-11-21 16:33:06,203 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 143 predicate places.
[2022-11-21 16:33:06,203 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 317 transitions, 3885 flow
[2022-11-21 16:33:06,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 93.17391304347827) internal successors, (2143), 23 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:06,204 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:06,204 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:06,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-11-21 16:33:06,204 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1152531953, now seen corresponding path program 4 times
[2022-11-21 16:33:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:06,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018618850]
[2022-11-21 16:33:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:08,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018618850]
[2022-11-21 16:33:08,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018618850] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:08,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:08,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-11-21 16:33:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404432181]
[2022-11-21 16:33:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:08,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-11-21 16:33:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-11-21 16:33:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380
[2022-11-21 16:33:08,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153
[2022-11-21 16:33:08,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 317 transitions, 3885 flow. Second operand has 20 states, 20 states have (on average 102.05) internal successors, (2041), 20 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:08,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:08,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153
[2022-11-21 16:33:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:10,753 INFO L130 PetriNetUnfolder]: 1679/6973 cut-off events.
[2022-11-21 16:33:10,753 INFO L131 PetriNetUnfolder]: For 23864/24430 co-relation queries the response was YES.
[2022-11-21 16:33:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18367 conditions, 6973 events. 1679/6973 cut-off events. For 23864/24430 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 85592 event pairs, 73 based on Foata normal form. 152/6838 useless extension candidates. Maximal degree in co-relation 18257. Up to 1126 conditions per place.
[2022-11-21 16:33:10,818 INFO L137 encePairwiseOnDemand]: 134/153 looper letters, 165 selfloop transitions, 106 changer transitions 22/395 dead transitions.
[2022-11-21 16:33:10,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 395 transitions, 5487 flow
[2022-11-21 16:33:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-11-21 16:33:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2022-11-21 16:33:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2100 transitions.
[2022-11-21 16:33:10,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216
[2022-11-21 16:33:10,821 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2100 transitions.
[2022-11-21 16:33:10,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2100 transitions.
[2022-11-21 16:33:10,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:10,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2100 transitions.
[2022-11-21 16:33:10,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 105.0) internal successors, (2100), 20 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:10,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:10,824 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:10,825 INFO L175 Difference]: Start difference. First operand has 303 places, 317 transitions, 3885 flow. Second operand 20 states and 2100 transitions.
[2022-11-21 16:33:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 395 transitions, 5487 flow
[2022-11-21 16:33:10,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 395 transitions, 5231 flow, removed 48 selfloop flow, removed 23 redundant places.
[2022-11-21 16:33:10,938 INFO L231 Difference]: Finished difference. Result has 298 places, 351 transitions, 4619 flow
[2022-11-21 16:33:10,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3706, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4619, PETRI_PLACES=298, PETRI_TRANSITIONS=351}
[2022-11-21 16:33:10,940 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 138 predicate places.
[2022-11-21 16:33:10,940 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 351 transitions, 4619 flow
[2022-11-21 16:33:10,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 102.05) internal successors, (2041), 20 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:10,940 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:10,940 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:10,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-11-21 16:33:10,941 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash -482725147, now seen corresponding path program 5 times
[2022-11-21 16:33:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:10,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291788812]
[2022-11-21 16:33:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:17,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291788812]
[2022-11-21 16:33:17,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291788812] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:17,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:17,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2022-11-21 16:33:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019226406]
[2022-11-21 16:33:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:17,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2022-11-21 16:33:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2022-11-21 16:33:17,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600
[2022-11-21 16:33:17,774 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153
[2022-11-21 16:33:17,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 351 transitions, 4619 flow. Second operand has 25 states, 25 states have (on average 93.08) internal successors, (2327), 25 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:17,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:17,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153
[2022-11-21 16:33:17,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:21,439 INFO L130 PetriNetUnfolder]: 1792/7459 cut-off events.
[2022-11-21 16:33:21,439 INFO L131 PetriNetUnfolder]: For 26610/27577 co-relation queries the response was YES.
[2022-11-21 16:33:21,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20186 conditions, 7459 events. 1792/7459 cut-off events. For 26610/27577 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 93230 event pairs, 60 based on Foata normal form. 186/7339 useless extension candidates. Maximal degree in co-relation 20070. Up to 1218 conditions per place.
[2022-11-21 16:33:21,537 INFO L137 encePairwiseOnDemand]: 131/153 looper letters, 187 selfloop transitions, 106 changer transitions 11/395 dead transitions.
[2022-11-21 16:33:21,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 395 transitions, 5661 flow
[2022-11-21 16:33:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-11-21 16:33:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2022-11-21 16:33:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2386 transitions.
[2022-11-21 16:33:21,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6237908496732026
[2022-11-21 16:33:21,542 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2386 transitions.
[2022-11-21 16:33:21,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2386 transitions.
[2022-11-21 16:33:21,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:21,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2386 transitions.
[2022-11-21 16:33:21,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 95.44) internal successors, (2386), 25 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:21,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 153.0) internal successors, (3978), 26 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:21,551 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 153.0) internal successors, (3978), 26 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:21,552 INFO L175 Difference]: Start difference. First operand has 298 places, 351 transitions, 4619 flow. Second operand 25 states and 2386 transitions.
[2022-11-21 16:33:21,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 395 transitions, 5661 flow
[2022-11-21 16:33:21,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 395 transitions, 5411 flow, removed 83 selfloop flow, removed 12 redundant places.
[2022-11-21 16:33:21,722 INFO L231 Difference]: Finished difference. Result has 318 places, 362 transitions, 4817 flow
[2022-11-21 16:33:21,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4409, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4817, PETRI_PLACES=318, PETRI_TRANSITIONS=362}
[2022-11-21 16:33:21,723 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 158 predicate places.
[2022-11-21 16:33:21,723 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 362 transitions, 4817 flow
[2022-11-21 16:33:21,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 93.08) internal successors, (2327), 25 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:21,724 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:21,724 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:21,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-11-21 16:33:21,724 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 752402673, now seen corresponding path program 6 times
[2022-11-21 16:33:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:21,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250126783]
[2022-11-21 16:33:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:27,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:27,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250126783]
[2022-11-21 16:33:27,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250126783] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:27,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:27,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-11-21 16:33:27,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263080387]
[2022-11-21 16:33:27,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:27,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-11-21 16:33:27,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-11-21 16:33:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506
[2022-11-21 16:33:27,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153
[2022-11-21 16:33:27,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 362 transitions, 4817 flow. Second operand has 23 states, 23 states have (on average 94.17391304347827) internal successors, (2166), 23 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:27,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:27,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153
[2022-11-21 16:33:28,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:32,154 INFO L130 PetriNetUnfolder]: 1906/7915 cut-off events.
[2022-11-21 16:33:32,154 INFO L131 PetriNetUnfolder]: For 29179/30202 co-relation queries the response was YES.
[2022-11-21 16:33:32,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21557 conditions, 7915 events. 1906/7915 cut-off events. For 29179/30202 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 99910 event pairs, 42 based on Foata normal form. 206/7781 useless extension candidates. Maximal degree in co-relation 21417. Up to 1292 conditions per place.
[2022-11-21 16:33:32,270 INFO L137 encePairwiseOnDemand]: 133/153 looper letters, 190 selfloop transitions, 120 changer transitions 7/410 dead transitions.
[2022-11-21 16:33:32,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 410 transitions, 6047 flow
[2022-11-21 16:33:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-11-21 16:33:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2022-11-21 16:33:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2323 transitions.
[2022-11-21 16:33:32,274 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6326252723311547
[2022-11-21 16:33:32,275 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2323 transitions.
[2022-11-21 16:33:32,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2323 transitions.
[2022-11-21 16:33:32,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:32,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2323 transitions.
[2022-11-21 16:33:32,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 96.79166666666667) internal successors, (2323), 24 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:32,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:32,281 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:32,281 INFO L175 Difference]: Start difference. First operand has 318 places, 362 transitions, 4817 flow. Second operand 24 states and 2323 transitions.
[2022-11-21 16:33:32,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 410 transitions, 6047 flow
[2022-11-21 16:33:32,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 410 transitions, 5746 flow, removed 81 selfloop flow, removed 18 redundant places.
[2022-11-21 16:33:32,519 INFO L231 Difference]: Finished difference. Result has 326 places, 381 transitions, 5257 flow
[2022-11-21 16:33:32,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4588, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5257, PETRI_PLACES=326, PETRI_TRANSITIONS=381}
[2022-11-21 16:33:32,520 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 166 predicate places.
[2022-11-21 16:33:32,520 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 381 transitions, 5257 flow
[2022-11-21 16:33:32,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 94.17391304347827) internal successors, (2166), 23 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:32,521 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:32,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:32,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-11-21 16:33:32,521 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 963043091, now seen corresponding path program 7 times
[2022-11-21 16:33:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:32,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729315664]
[2022-11-21 16:33:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:32,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:34,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729315664]
[2022-11-21 16:33:34,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729315664] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:34,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:34,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-11-21 16:33:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211445769]
[2022-11-21 16:33:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:34,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-11-21 16:33:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-11-21 16:33:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462
[2022-11-21 16:33:34,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 153
[2022-11-21 16:33:34,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 381 transitions, 5257 flow. Second operand has 22 states, 22 states have (on average 99.0) internal successors, (2178), 22 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:34,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:34,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 153
[2022-11-21 16:33:34,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:37,710 INFO L130 PetriNetUnfolder]: 2151/8970 cut-off events.
[2022-11-21 16:33:37,711 INFO L131 PetriNetUnfolder]: For 31858/32762 co-relation queries the response was YES.
[2022-11-21 16:33:37,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24069 conditions, 8970 events. 2151/8970 cut-off events. For 31858/32762 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 116441 event pairs, 91 based on Foata normal form. 181/8767 useless extension candidates. Maximal degree in co-relation 23957. Up to 1486 conditions per place.
[2022-11-21 16:33:37,832 INFO L137 encePairwiseOnDemand]: 135/153 looper letters, 178 selfloop transitions, 110 changer transitions 47/434 dead transitions.
[2022-11-21 16:33:37,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 434 transitions, 6676 flow
[2022-11-21 16:33:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-11-21 16:33:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2022-11-21 16:33:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2131 transitions.
[2022-11-21 16:33:37,835 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6632430750077809
[2022-11-21 16:33:37,836 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2131 transitions.
[2022-11-21 16:33:37,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2131 transitions.
[2022-11-21 16:33:37,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:37,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2131 transitions.
[2022-11-21 16:33:37,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 101.47619047619048) internal successors, (2131), 21 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:37,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:37,844 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:37,844 INFO L175 Difference]: Start difference. First operand has 326 places, 381 transitions, 5257 flow. Second operand 21 states and 2131 transitions.
[2022-11-21 16:33:37,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 434 transitions, 6676 flow
[2022-11-21 16:33:38,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 434 transitions, 6496 flow, removed 65 selfloop flow, removed 13 redundant places.
[2022-11-21 16:33:38,082 INFO L231 Difference]: Finished difference. Result has 336 places, 369 transitions, 5196 flow
[2022-11-21 16:33:38,082 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=5085, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5196, PETRI_PLACES=336, PETRI_TRANSITIONS=369}
[2022-11-21 16:33:38,083 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 176 predicate places.
[2022-11-21 16:33:38,083 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 369 transitions, 5196 flow
[2022-11-21 16:33:38,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 99.0) internal successors, (2178), 22 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:38,083 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:38,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:38,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2022-11-21 16:33:38,084 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -761334467, now seen corresponding path program 8 times
[2022-11-21 16:33:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:38,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555767299]
[2022-11-21 16:33:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:42,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:42,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555767299]
[2022-11-21 16:33:42,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555767299] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:42,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:42,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-11-21 16:33:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305710380]
[2022-11-21 16:33:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:42,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-11-21 16:33:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:42,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-11-21 16:33:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462
[2022-11-21 16:33:42,780 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153
[2022-11-21 16:33:42,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 369 transitions, 5196 flow. Second operand has 22 states, 22 states have (on average 94.31818181818181) internal successors, (2075), 22 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:42,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:42,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153
[2022-11-21 16:33:42,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:45,915 INFO L130 PetriNetUnfolder]: 1944/7945 cut-off events.
[2022-11-21 16:33:45,915 INFO L131 PetriNetUnfolder]: For 33062/34013 co-relation queries the response was YES.
[2022-11-21 16:33:46,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22748 conditions, 7945 events. 1944/7945 cut-off events. For 33062/34013 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 101011 event pairs, 57 based on Foata normal form. 193/7806 useless extension candidates. Maximal degree in co-relation 22677. Up to 1318 conditions per place.
[2022-11-21 16:33:46,044 INFO L137 encePairwiseOnDemand]: 132/153 looper letters, 185 selfloop transitions, 140 changer transitions 16/433 dead transitions.
[2022-11-21 16:33:46,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 433 transitions, 6752 flow
[2022-11-21 16:33:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-11-21 16:33:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2022-11-21 16:33:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2042 transitions.
[2022-11-21 16:33:46,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6355431061313415
[2022-11-21 16:33:46,048 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2042 transitions.
[2022-11-21 16:33:46,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2042 transitions.
[2022-11-21 16:33:46,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:46,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2042 transitions.
[2022-11-21 16:33:46,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 97.23809523809524) internal successors, (2042), 21 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:46,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:46,055 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:46,055 INFO L175 Difference]: Start difference. First operand has 336 places, 369 transitions, 5196 flow. Second operand 21 states and 2042 transitions.
[2022-11-21 16:33:46,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 433 transitions, 6752 flow
[2022-11-21 16:33:46,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 433 transitions, 6433 flow, removed 33 selfloop flow, removed 20 redundant places.
[2022-11-21 16:33:46,280 INFO L231 Difference]: Finished difference. Result has 329 places, 390 transitions, 5734 flow
[2022-11-21 16:33:46,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4925, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5734, PETRI_PLACES=329, PETRI_TRANSITIONS=390}
[2022-11-21 16:33:46,281 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 169 predicate places.
[2022-11-21 16:33:46,281 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 390 transitions, 5734 flow
[2022-11-21 16:33:46,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 94.31818181818181) internal successors, (2075), 22 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:46,282 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:46,283 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:46,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2022-11-21 16:33:46,283 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash -711036095, now seen corresponding path program 9 times
[2022-11-21 16:33:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:46,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855753661]
[2022-11-21 16:33:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:33:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:33:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:33:51,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855753661]
[2022-11-21 16:33:51,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855753661] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:33:51,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:33:51,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-11-21 16:33:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749162013]
[2022-11-21 16:33:51,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:33:51,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-11-21 16:33:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:33:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-11-21 16:33:51,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552
[2022-11-21 16:33:51,296 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 153
[2022-11-21 16:33:51,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 390 transitions, 5734 flow. Second operand has 24 states, 24 states have (on average 92.125) internal successors, (2211), 24 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:51,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:33:51,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 153
[2022-11-21 16:33:51,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:33:54,865 INFO L130 PetriNetUnfolder]: 2110/8645 cut-off events.
[2022-11-21 16:33:54,865 INFO L131 PetriNetUnfolder]: For 35415/36425 co-relation queries the response was YES.
[2022-11-21 16:33:54,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23802 conditions, 8645 events. 2110/8645 cut-off events. For 35415/36425 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 112011 event pairs, 66 based on Foata normal form. 192/8479 useless extension candidates. Maximal degree in co-relation 23733. Up to 1448 conditions per place.
[2022-11-21 16:33:54,956 INFO L137 encePairwiseOnDemand]: 130/153 looper letters, 184 selfloop transitions, 137 changer transitions 20/433 dead transitions.
[2022-11-21 16:33:54,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 433 transitions, 6891 flow
[2022-11-21 16:33:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-11-21 16:33:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2022-11-21 16:33:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2081 transitions.
[2022-11-21 16:33:54,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6182412358882947
[2022-11-21 16:33:54,959 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2081 transitions.
[2022-11-21 16:33:54,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2081 transitions.
[2022-11-21 16:33:54,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:33:54,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2081 transitions.
[2022-11-21 16:33:54,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 94.5909090909091) internal successors, (2081), 22 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:54,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:54,967 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 153.0) internal successors, (3519), 23 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:54,967 INFO L175 Difference]: Start difference. First operand has 329 places, 390 transitions, 5734 flow. Second operand 22 states and 2081 transitions.
[2022-11-21 16:33:54,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 433 transitions, 6891 flow
[2022-11-21 16:33:55,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 433 transitions, 6528 flow, removed 48 selfloop flow, removed 20 redundant places.
[2022-11-21 16:33:55,199 INFO L231 Difference]: Finished difference. Result has 335 places, 404 transitions, 5972 flow
[2022-11-21 16:33:55,200 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=5391, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5972, PETRI_PLACES=335, PETRI_TRANSITIONS=404}
[2022-11-21 16:33:55,200 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 175 predicate places.
[2022-11-21 16:33:55,201 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 404 transitions, 5972 flow
[2022-11-21 16:33:55,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 92.125) internal successors, (2211), 24 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:33:55,201 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:33:55,201 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:33:55,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2022-11-21 16:33:55,202 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:33:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:33:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash -772625929, now seen corresponding path program 10 times
[2022-11-21 16:33:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:33:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099162305]
[2022-11-21 16:33:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:33:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:33:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:34:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:34:00,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:34:00,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099162305]
[2022-11-21 16:34:00,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099162305] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:34:00,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:34:00,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-11-21 16:34:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570817651]
[2022-11-21 16:34:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:34:00,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-11-21 16:34:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:34:00,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-11-21 16:34:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552
[2022-11-21 16:34:00,084 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153
[2022-11-21 16:34:00,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 404 transitions, 5972 flow. Second operand has 24 states, 24 states have (on average 96.95833333333333) internal successors, (2327), 24 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:00,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:34:00,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153
[2022-11-21 16:34:00,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:34:03,696 INFO L130 PetriNetUnfolder]: 2140/8822 cut-off events.
[2022-11-21 16:34:03,696 INFO L131 PetriNetUnfolder]: For 36920/37980 co-relation queries the response was YES.
[2022-11-21 16:34:03,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24930 conditions, 8822 events. 2140/8822 cut-off events. For 36920/37980 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 114642 event pairs, 52 based on Foata normal form. 213/8680 useless extension candidates. Maximal degree in co-relation 24862. Up to 1474 conditions per place.
[2022-11-21 16:34:03,848 INFO L137 encePairwiseOnDemand]: 132/153 looper letters, 226 selfloop transitions, 135 changer transitions 9/466 dead transitions.
[2022-11-21 16:34:03,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 466 transitions, 7491 flow
[2022-11-21 16:34:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2022-11-21 16:34:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2022-11-21 16:34:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1908 transitions.
[2022-11-21 16:34:03,851 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6563467492260062
[2022-11-21 16:34:03,851 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1908 transitions.
[2022-11-21 16:34:03,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1908 transitions.
[2022-11-21 16:34:03,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:34:03,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1908 transitions.
[2022-11-21 16:34:03,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 100.42105263157895) internal successors, (1908), 19 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:03,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 153.0) internal successors, (3060), 20 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:03,855 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 153.0) internal successors, (3060), 20 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:03,856 INFO L175 Difference]: Start difference. First operand has 335 places, 404 transitions, 5972 flow. Second operand 19 states and 1908 transitions.
[2022-11-21 16:34:03,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 466 transitions, 7491 flow
[2022-11-21 16:34:04,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 466 transitions, 7172 flow, removed 82 selfloop flow, removed 19 redundant places.
[2022-11-21 16:34:04,163 INFO L231 Difference]: Finished difference. Result has 336 places, 422 transitions, 6370 flow
[2022-11-21 16:34:04,163 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=5733, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6370, PETRI_PLACES=336, PETRI_TRANSITIONS=422}
[2022-11-21 16:34:04,164 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 176 predicate places.
[2022-11-21 16:34:04,164 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 422 transitions, 6370 flow
[2022-11-21 16:34:04,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 96.95833333333333) internal successors, (2327), 24 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:04,165 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:34:04,165 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:04,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2022-11-21 16:34:04,165 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:34:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:34:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1606606235, now seen corresponding path program 11 times
[2022-11-21 16:34:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:34:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144056267]
[2022-11-21 16:34:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:34:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:34:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:34:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:34:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:34:09,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144056267]
[2022-11-21 16:34:09,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144056267] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:34:09,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:34:09,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-11-21 16:34:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669788463]
[2022-11-21 16:34:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:34:09,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-11-21 16:34:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:34:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-11-21 16:34:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552
[2022-11-21 16:34:09,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153
[2022-11-21 16:34:09,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 422 transitions, 6370 flow. Second operand has 24 states, 24 states have (on average 94.08333333333333) internal successors, (2258), 24 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:09,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:34:09,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153
[2022-11-21 16:34:09,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:34:13,147 INFO L130 PetriNetUnfolder]: 2400/9895 cut-off events.
[2022-11-21 16:34:13,147 INFO L131 PetriNetUnfolder]: For 41261/42419 co-relation queries the response was YES.
[2022-11-21 16:34:13,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27685 conditions, 9895 events. 2400/9895 cut-off events. For 41261/42419 co-relation queries the response was YES. Maximal size of possible extension queue 1410. Compared 131849 event pairs, 70 based on Foata normal form. 229/9715 useless extension candidates. Maximal degree in co-relation 27617. Up to 1676 conditions per place.
[2022-11-21 16:34:13,303 INFO L137 encePairwiseOnDemand]: 132/153 looper letters, 240 selfloop transitions, 130 changer transitions 8/471 dead transitions.
[2022-11-21 16:34:13,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 471 transitions, 7779 flow
[2022-11-21 16:34:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-11-21 16:34:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2022-11-21 16:34:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2028 transitions.
[2022-11-21 16:34:13,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6311858076563959
[2022-11-21 16:34:13,306 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2028 transitions.
[2022-11-21 16:34:13,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2028 transitions.
[2022-11-21 16:34:13,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:34:13,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2028 transitions.
[2022-11-21 16:34:13,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 96.57142857142857) internal successors, (2028), 21 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:13,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:13,315 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:13,315 INFO L175 Difference]: Start difference. First operand has 336 places, 422 transitions, 6370 flow. Second operand 21 states and 2028 transitions.
[2022-11-21 16:34:13,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 471 transitions, 7779 flow
[2022-11-21 16:34:13,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 471 transitions, 7600 flow, removed 42 selfloop flow, removed 13 redundant places.
[2022-11-21 16:34:13,747 INFO L231 Difference]: Finished difference. Result has 347 places, 436 transitions, 6766 flow
[2022-11-21 16:34:13,748 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6211, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6766, PETRI_PLACES=347, PETRI_TRANSITIONS=436}
[2022-11-21 16:34:13,748 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 187 predicate places.
[2022-11-21 16:34:13,748 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 436 transitions, 6766 flow
[2022-11-21 16:34:13,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 94.08333333333333) internal successors, (2258), 24 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:13,749 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:34:13,749 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:13,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2022-11-21 16:34:13,749 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:34:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:34:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1474904683, now seen corresponding path program 12 times
[2022-11-21 16:34:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:34:13,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798400445]
[2022-11-21 16:34:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:34:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:34:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:34:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:34:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:34:16,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798400445]
[2022-11-21 16:34:16,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798400445] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:34:16,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:34:16,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-11-21 16:34:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373284364]
[2022-11-21 16:34:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:34:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-11-21 16:34:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:34:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-11-21 16:34:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272
[2022-11-21 16:34:16,920 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153
[2022-11-21 16:34:16,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 436 transitions, 6766 flow. Second operand has 17 states, 17 states have (on average 109.41176470588235) internal successors, (1860), 17 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:16,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:34:16,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153
[2022-11-21 16:34:16,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:34:20,045 INFO L130 PetriNetUnfolder]: 2409/9945 cut-off events.
[2022-11-21 16:34:20,046 INFO L131 PetriNetUnfolder]: For 44639/45863 co-relation queries the response was YES.
[2022-11-21 16:34:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28046 conditions, 9945 events. 2409/9945 cut-off events. For 44639/45863 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 132562 event pairs, 85 based on Foata normal form. 265/9801 useless extension candidates. Maximal degree in co-relation 27975. Up to 1680 conditions per place.
[2022-11-21 16:34:20,216 INFO L137 encePairwiseOnDemand]: 138/153 looper letters, 200 selfloop transitions, 124 changer transitions 15/449 dead transitions.
[2022-11-21 16:34:20,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 449 transitions, 7532 flow
[2022-11-21 16:34:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-11-21 16:34:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2022-11-21 16:34:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1680 transitions.
[2022-11-21 16:34:20,220 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496
[2022-11-21 16:34:20,220 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1680 transitions.
[2022-11-21 16:34:20,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1680 transitions.
[2022-11-21 16:34:20,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:34:20,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1680 transitions.
[2022-11-21 16:34:20,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:20,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:20,227 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:20,227 INFO L175 Difference]: Start difference. First operand has 347 places, 436 transitions, 6766 flow. Second operand 15 states and 1680 transitions.
[2022-11-21 16:34:20,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 449 transitions, 7532 flow
[2022-11-21 16:34:20,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 449 transitions, 7335 flow, removed 31 selfloop flow, removed 16 redundant places.
[2022-11-21 16:34:20,624 INFO L231 Difference]: Finished difference. Result has 346 places, 429 transitions, 6736 flow
[2022-11-21 16:34:20,625 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6577, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6736, PETRI_PLACES=346, PETRI_TRANSITIONS=429}
[2022-11-21 16:34:20,626 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 186 predicate places.
[2022-11-21 16:34:20,626 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 429 transitions, 6736 flow
[2022-11-21 16:34:20,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 109.41176470588235) internal successors, (1860), 17 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:20,626 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:34:20,627 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2022-11-21 16:34:20,627 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:34:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:34:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1575110441, now seen corresponding path program 13 times
[2022-11-21 16:34:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:34:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643280279]
[2022-11-21 16:34:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:34:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:34:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:34:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:34:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:34:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643280279]
[2022-11-21 16:34:25,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643280279] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:34:25,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:34:25,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-11-21 16:34:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366761547]
[2022-11-21 16:34:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:34:25,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-11-21 16:34:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:34:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-11-21 16:34:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462
[2022-11-21 16:34:25,345 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153
[2022-11-21 16:34:25,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 429 transitions, 6736 flow. Second operand has 22 states, 22 states have (on average 97.18181818181819) internal successors, (2138), 22 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:25,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:34:25,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153
[2022-11-21 16:34:25,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:34:28,959 INFO L130 PetriNetUnfolder]: 2368/9798 cut-off events.
[2022-11-21 16:34:28,959 INFO L131 PetriNetUnfolder]: For 44803/45934 co-relation queries the response was YES.
[2022-11-21 16:34:29,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27693 conditions, 9798 events. 2368/9798 cut-off events. For 44803/45934 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 130387 event pairs, 70 based on Foata normal form. 241/9641 useless extension candidates. Maximal degree in co-relation 27621. Up to 1656 conditions per place.
[2022-11-21 16:34:29,175 INFO L137 encePairwiseOnDemand]: 132/153 looper letters, 218 selfloop transitions, 138 changer transitions 13/464 dead transitions.
[2022-11-21 16:34:29,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 464 transitions, 7893 flow
[2022-11-21 16:34:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-11-21 16:34:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2022-11-21 16:34:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2096 transitions.
[2022-11-21 16:34:29,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.652349828820417
[2022-11-21 16:34:29,178 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2096 transitions.
[2022-11-21 16:34:29,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2096 transitions.
[2022-11-21 16:34:29,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:34:29,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2096 transitions.
[2022-11-21 16:34:29,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 99.80952380952381) internal successors, (2096), 21 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:29,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:29,182 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:29,182 INFO L175 Difference]: Start difference. First operand has 346 places, 429 transitions, 6736 flow. Second operand 21 states and 2096 transitions.
[2022-11-21 16:34:29,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 464 transitions, 7893 flow
[2022-11-21 16:34:29,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 464 transitions, 7603 flow, removed 27 selfloop flow, removed 12 redundant places.
[2022-11-21 16:34:29,519 INFO L231 Difference]: Finished difference. Result has 355 places, 433 transitions, 6827 flow
[2022-11-21 16:34:29,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6463, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6827, PETRI_PLACES=355, PETRI_TRANSITIONS=433}
[2022-11-21 16:34:29,520 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 195 predicate places.
[2022-11-21 16:34:29,520 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 433 transitions, 6827 flow
[2022-11-21 16:34:29,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 97.18181818181819) internal successors, (2138), 22 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:29,521 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:34:29,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:29,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2022-11-21 16:34:29,521 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:34:29,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:34:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 87840479, now seen corresponding path program 14 times
[2022-11-21 16:34:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:34:29,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344869275]
[2022-11-21 16:34:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:34:29,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:34:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-21 16:34:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-21 16:34:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-21 16:34:34,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344869275]
[2022-11-21 16:34:34,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344869275] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-21 16:34:34,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-21 16:34:34,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-11-21 16:34:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374403256]
[2022-11-21 16:34:34,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-21 16:34:34,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-11-21 16:34:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-21 16:34:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-11-21 16:34:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506
[2022-11-21 16:34:34,706 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153
[2022-11-21 16:34:34,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 433 transitions, 6827 flow. Second operand has 23 states, 23 states have (on average 94.17391304347827) internal successors, (2166), 23 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:34,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-21 16:34:34,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153
[2022-11-21 16:34:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-21 16:34:37,946 INFO L130 PetriNetUnfolder]: 2369/9810 cut-off events.
[2022-11-21 16:34:37,947 INFO L131 PetriNetUnfolder]: For 46636/47780 co-relation queries the response was YES.
[2022-11-21 16:34:38,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28016 conditions, 9810 events. 2369/9810 cut-off events. For 46636/47780 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 130427 event pairs, 75 based on Foata normal form. 229/9636 useless extension candidates. Maximal degree in co-relation 27941. Up to 1650 conditions per place.
[2022-11-21 16:34:38,118 INFO L137 encePairwiseOnDemand]: 134/153 looper letters, 233 selfloop transitions, 124 changer transitions 12/462 dead transitions.
[2022-11-21 16:34:38,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 462 transitions, 7897 flow
[2022-11-21 16:34:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-11-21 16:34:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2022-11-21 16:34:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1934 transitions.
[2022-11-21 16:34:38,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6320261437908496
[2022-11-21 16:34:38,120 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1934 transitions.
[2022-11-21 16:34:38,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1934 transitions.
[2022-11-21 16:34:38,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-21 16:34:38,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1934 transitions.
[2022-11-21 16:34:38,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 96.7) internal successors, (1934), 20 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:38,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:38,129 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:38,129 INFO L175 Difference]: Start difference. First operand has 355 places, 433 transitions, 6827 flow. Second operand 20 states and 1934 transitions.
[2022-11-21 16:34:38,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 462 transitions, 7897 flow
[2022-11-21 16:34:38,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 462 transitions, 7658 flow, removed 37 selfloop flow, removed 18 redundant places.
[2022-11-21 16:34:38,597 INFO L231 Difference]: Finished difference. Result has 356 places, 435 transitions, 6900 flow
[2022-11-21 16:34:38,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6594, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6900, PETRI_PLACES=356, PETRI_TRANSITIONS=435}
[2022-11-21 16:34:38,598 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 196 predicate places.
[2022-11-21 16:34:38,598 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 435 transitions, 6900 flow
[2022-11-21 16:34:38,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 94.17391304347827) internal successors, (2166), 23 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-21 16:34:38,598 INFO L201 CegarLoopForPetriNet]: Found error trace
[2022-11-21 16:34:38,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:38,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2022-11-21 16:34:38,599 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-11-21 16:34:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-21 16:34:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -475957437, now seen corresponding path program 15 times
[2022-11-21 16:34:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-21 16:34:38,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180962699]
[2022-11-21 16:34:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-21 16:34:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-21 16:34:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-21 16:34:38,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-21 16:34:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-21 16:34:38,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-21 16:34:38,884 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-21 16:34:38,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2022-11-21 16:34:38,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2022-11-21 16:34:38,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2022-11-21 16:34:38,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2022-11-21 16:34:38,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2022-11-21 16:34:38,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2022-11-21 16:34:38,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2022-11-21 16:34:38,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2022-11-21 16:34:38,896 INFO L444 BasicCegarLoop]: Path program histogram: [15, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1]
[2022-11-21 16:34:38,905 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-11-21 16:34:38,905 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-21 16:34:39,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:34:39 BasicIcfg
[2022-11-21 16:34:39,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-21 16:34:39,212 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-21 16:34:39,212 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-21 16:34:39,212 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-21 16:34:39,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:31:22" (3/4) ...
[2022-11-21 16:34:39,215 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2022-11-21 16:34:39,477 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/witness.graphml
[2022-11-21 16:34:39,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-21 16:34:39,478 INFO L158 Benchmark]: Toolchain (without parser) took 199544.97ms. Allocated memory was 130.0MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 84.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB.
[2022-11-21 16:34:39,479 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 107.0MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-21 16:34:39,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 783.10ms. Allocated memory is still 130.0MB. Free memory was 84.2MB in the beginning and 81.2MB in the end (delta: 3.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2022-11-21 16:34:39,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.49ms. Allocated memory is still 130.0MB. Free memory was 81.2MB in the beginning and 78.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-21 16:34:39,480 INFO L158 Benchmark]: Boogie Preprocessor took 54.53ms. Allocated memory is still 130.0MB. Free memory was 78.1MB in the beginning and 75.4MB in the end (delta: 2.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2022-11-21 16:34:39,480 INFO L158 Benchmark]: RCFGBuilder took 1497.18ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 75.4MB in the beginning and 82.9MB in the end (delta: -7.5MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB.
[2022-11-21 16:34:39,481 INFO L158 Benchmark]: TraceAbstraction took 196884.57ms. Allocated memory was 165.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 82.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
[2022-11-21 16:34:39,481 INFO L158 Benchmark]: Witness Printer took 266.09ms. Allocated memory is still 3.9GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 72.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB.
[2022-11-21 16:34:39,483 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.28ms. Allocated memory is still 107.0MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 783.10ms. Allocated memory is still 130.0MB. Free memory was 84.2MB in the beginning and 81.2MB in the end (delta: 3.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 50.49ms. Allocated memory is still 130.0MB. Free memory was 81.2MB in the beginning and 78.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 54.53ms. Allocated memory is still 130.0MB. Free memory was 78.1MB in the beginning and 75.4MB in the end (delta: 2.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* RCFGBuilder took 1497.18ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 75.4MB in the beginning and 82.9MB in the end (delta: -7.5MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 196884.57ms. Allocated memory was 165.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 82.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
* Witness Printer took 266.09ms. Allocated memory is still 3.9GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 72.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L711] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L713] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L715] 0 int __unbuffered_p0_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0]
[L717] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0]
[L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0]
[L719] 0 int __unbuffered_p2_EAX$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0]
[L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0]
[L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0]
[L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0]
[L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0]
[L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0]
[L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0]
[L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0]
[L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0]
[L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0]
[L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0]
[L730] 0 _Bool __unbuffered_p2_EAX$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0]
[L731] 0 int *__unbuffered_p2_EAX$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}]
[L732] 0 int __unbuffered_p2_EAX$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0]
[L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0]
[L734] 0 int __unbuffered_p2_EAX$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0]
[L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0]
[L737] 0 int __unbuffered_p2_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0]
[L738] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L739] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L741] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}]
[L742] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0]
[L743] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0]
[L744] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L745] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L746] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L747] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L748] 0 _Bool x$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0]
[L749] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0]
[L750] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L751] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L752] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L753] 0 _Bool x$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0]
[L754] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0]
[L755] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L756] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L757] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L758] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L759] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L761] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L762] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L763] 0 _Bool weak$$choice1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L764] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L884] 0 pthread_t t2421;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-3, t2421={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L886] 0 pthread_t t2422;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={5:0}, t2422={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-2, t2421={5:0}, t2422={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L796] 2 x$w_buff1 = x$w_buff0
[L797] 2 x$w_buff0 = 1
[L798] 2 x$w_buff1_used = x$w_buff0_used
[L799] 2 x$w_buff0_used = (_Bool)1
[L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L806] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L888] 0 pthread_t t2423;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={5:0}, t2422={8:0}, t2423={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=-1, t2421={5:0}, t2422={8:0}, t2423={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L890] 0 pthread_t t2424;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={5:0}, t2422={8:0}, t2423={7:0}, t2424={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L823] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L824] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L825] 3 x$flush_delayed = weak$$choice2
[L826] EXPR 3 \read(x)
[L826] 3 x$mem_tmp = x
[L827] 3 weak$$choice1 = __VERIFIER_nondet_bool()
[L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))
[L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))
[L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)
[L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x
[L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)
[L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))
[L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))
[L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))))
[L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))))
[L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))
[L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x
[L837] EXPR 3 \read(x)
[L837] 3 __unbuffered_p2_EAX = x
[L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x
[L838] 3 x = x$flush_delayed ? x$mem_tmp : x
[L839] 3 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L842] 3 __unbuffered_p2_EBX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L845] EXPR 3 \read(x)
[L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=0, t2421={5:0}, t2422={8:0}, t2423={7:0}, t2424={4:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L859] 4 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L768] 1 __unbuffered_p0_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L771] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L772] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L773] 1 x$flush_delayed = weak$$choice2
[L774] EXPR 1 \read(x)
[L774] 1 x$mem_tmp = x
[L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L775] EXPR 1 \read(x)
[L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L782] EXPR 1 \read(x)
[L782] 1 __unbuffered_p0_EBX = x
[L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L783] EXPR 1 \read(x)
[L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L783] 1 x = x$flush_delayed ? x$mem_tmp : x
[L784] 1 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L862] EXPR 4 \read(x)
[L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={5:0}, t2422={8:0}, t2423={7:0}, t2424={4:0}, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L895] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L895] RET 0 assume_abort_if_not(main$tmp_guard0)
[L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L897] EXPR 0 \read(x)
[L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={5:0}, t2422={8:0}, t2423={7:0}, t2424={4:0}, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L904] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var)
[L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={5:0}, t2422={8:0}, t2423={7:0}, t2424={4:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L908] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L19] 0 reach_error()
VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
- UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 891]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 186 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 196.4s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 91.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3764 SdHoareTripleChecker+Valid, 21.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3764 mSDsluCounter, 6203 SdHoareTripleChecker+Invalid, 19.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5381 mSDsCounter, 1434 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16452 IncrementalHoareTripleChecker+Invalid, 17886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1434 mSolverCounterUnsat, 822 mSDtfsCounter, 16452 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 877 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6004 ImplicationChecksByTransitivity, 33.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6900occurred in iteration=34, InterpolantAutomatonStates: 678, 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.2s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 100.9s InterpolantComputationTime, 4092 NumberOfCodeBlocks, 4092 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3936 ConstructedInterpolants, 0 QuantifiedInterpolants, 65599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-11-21 16:34:39,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1777ba-9642-4135-98aa-74b2b7b81150/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE