/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:23:11,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:23:11,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:23:12,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:23:12,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:23:12,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:23:12,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:23:12,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:23:12,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:23:12,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:23:12,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:23:12,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:23:12,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:23:12,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:23:12,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:23:12,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:23:12,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:23:12,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:23:12,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:23:12,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:23:12,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:23:12,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:23:12,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:23:12,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:23:12,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:23:12,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:23:12,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:23:12,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:23:12,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:23:12,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:23:12,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:23:12,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:23:12,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:23:12,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:23:12,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:23:12,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:23:12,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:23:12,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:23:12,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:23:12,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:23:12,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:23:12,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 06:23:12,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:23:12,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:23:12,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:23:12,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:23:12,096 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:23:12,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:23:12,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:23:12,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:23:12,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:23:12,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:23:12,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:23:12,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:23:12,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:23:12,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:23:12,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:23:12,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:23:12,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:23:12,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:23:12,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:23:12,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:23:12,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:23:12,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:23:12,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:23:12,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:23:12,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:23:12,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:23:12,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:23:12,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:23:12,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:23:12,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:23:12,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:23:12,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:23:12,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:23:12,426 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:23:12,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:23:13,541 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:23:13,777 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:23:13,777 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:23:13,799 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ee80bdc/1163a53814664b74a56b8bfb76a155f2/FLAG19d3da2af [2022-12-13 06:23:13,811 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ee80bdc/1163a53814664b74a56b8bfb76a155f2 [2022-12-13 06:23:13,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:23:13,813 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:23:13,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:23:13,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:23:13,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:23:13,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:23:13" (1/1) ... [2022-12-13 06:23:13,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1102f7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:13, skipping insertion in model container [2022-12-13 06:23:13,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:23:13" (1/1) ... [2022-12-13 06:23:13,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:23:13,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:23:13,993 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 06:23:14,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:23:14,244 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:23:14,257 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 06:23:14,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:14,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:14,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:23:14,375 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:23:14,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14 WrapperNode [2022-12-13 06:23:14,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:23:14,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:23:14,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:23:14,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:23:14,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,450 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 06:23:14,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:23:14,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:23:14,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:23:14,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:23:14,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,486 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:23:14,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:23:14,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:23:14,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:23:14,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (1/1) ... [2022-12-13 06:23:14,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:23:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:23:14,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 06:23:14,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 06:23:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:23:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:23:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:23:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:23:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:23:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:23:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:23:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:23:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:23:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:23:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:23:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:23:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:23:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:23:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:23:14,578 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:23:14,707 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:23:14,709 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:23:15,036 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:23:15,184 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:23:15,184 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:23:15,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:23:15 BoogieIcfgContainer [2022-12-13 06:23:15,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:23:15,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:23:15,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:23:15,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:23:15,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:23:13" (1/3) ... [2022-12-13 06:23:15,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c1b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:23:15, skipping insertion in model container [2022-12-13 06:23:15,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:14" (2/3) ... [2022-12-13 06:23:15,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c1b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:23:15, skipping insertion in model container [2022-12-13 06:23:15,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:23:15" (3/3) ... [2022-12-13 06:23:15,197 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:23:15,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:23:15,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:23:15,215 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:23:15,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:23:15,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 06:23:15,399 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 06:23:15,399 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:15,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 06:23:15,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 06:23:15,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 06:23:15,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:15,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 06:23:15,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 06:23:15,451 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 06:23:15,451 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:15,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 06:23:15,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 06:23:15,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 06:23:24,364 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-13 06:23:24,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:23:24,382 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@79324ee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:23:24,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 06:23:24,384 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 06:23:24,384 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:24,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:24,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 06:23:24,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:24,389 INFO L85 PathProgramCache]: Analyzing trace with hash 487910, now seen corresponding path program 1 times [2022-12-13 06:23:24,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:24,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798524643] [2022-12-13 06:23:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:24,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:24,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798524643] [2022-12-13 06:23:24,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798524643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:24,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:24,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:23:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856017344] [2022-12-13 06:23:24,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:24,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:23:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:24,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:23:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:23:24,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-13 06:23:24,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-13 06:23:24,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:24,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-13 06:23:24,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:26,453 INFO L130 PetriNetUnfolder]: 7940/12385 cut-off events. [2022-12-13 06:23:26,454 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 06:23:26,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23823 conditions, 12385 events. 7940/12385 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 85411 event pairs, 3668 based on Foata normal form. 0/7468 useless extension candidates. Maximal degree in co-relation 23812. Up to 9645 conditions per place. [2022-12-13 06:23:26,501 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 2 changer transitions 61/108 dead transitions. [2022-12-13 06:23:26,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-13 06:23:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-12-13 06:23:26,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2022-12-13 06:23:26,519 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-13 06:23:26,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 108 transitions, 423 flow [2022-12-13 06:23:26,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 47 transitions, 181 flow [2022-12-13 06:23:26,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:26,616 INFO L89 Accepts]: Start accepts. Operand has 44 places, 47 transitions, 181 flow [2022-12-13 06:23:26,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:26,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:26,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 47 transitions, 181 flow [2022-12-13 06:23:26,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 47 transitions, 181 flow [2022-12-13 06:23:26,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 06:23:26,729 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:26,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 06:23:26,731 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 181 flow [2022-12-13 06:23:26,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-13 06:23:26,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:26,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:26,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:23:26,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1473676818, now seen corresponding path program 1 times [2022-12-13 06:23:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:26,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436637174] [2022-12-13 06:23:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436637174] [2022-12-13 06:23:27,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436637174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:27,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:27,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:27,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153774223] [2022-12-13 06:23:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:27,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:27,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:27,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:27,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 06:23:27,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-12-13 06:23:27,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:27,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 06:23:27,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:27,495 INFO L130 PetriNetUnfolder]: 1320/2199 cut-off events. [2022-12-13 06:23:27,496 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 06:23:27,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 2199 events. 1320/2199 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12364 event pairs, 112 based on Foata normal form. 30/1878 useless extension candidates. Maximal degree in co-relation 6060. Up to 1707 conditions per place. [2022-12-13 06:23:27,512 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 55 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 06:23:27,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 06:23:27,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 06:23:27,515 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -29 predicate places. [2022-12-13 06:23:27,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:27,543 INFO L89 Accepts]: Start accepts. Operand has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:27,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:27,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 06:23:27,563 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:27,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 06:23:27,564 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 68 transitions, 385 flow [2022-12-13 06:23:27,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-12-13 06:23:27,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:27,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:27,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:23:27,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:27,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1560657946, now seen corresponding path program 1 times [2022-12-13 06:23:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:27,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255038157] [2022-12-13 06:23:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255038157] [2022-12-13 06:23:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255038157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:27,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:27,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012230305] [2022-12-13 06:23:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:27,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:27,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:27,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 06:23:27,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 68 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-13 06:23:27,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:27,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 06:23:27,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:28,113 INFO L130 PetriNetUnfolder]: 1269/2024 cut-off events. [2022-12-13 06:23:28,113 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2022-12-13 06:23:28,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7638 conditions, 2024 events. 1269/2024 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10261 event pairs, 80 based on Foata normal form. 20/1702 useless extension candidates. Maximal degree in co-relation 7621. Up to 1636 conditions per place. [2022-12-13 06:23:28,131 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 77 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2022-12-13 06:23:28,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 06:23:28,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 06:23:28,134 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -27 predicate places. [2022-12-13 06:23:28,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,165 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:28,166 INFO L89 Accepts]: Start accepts. Operand has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:28,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:28,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 06:23:28,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:28,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 06:23:28,179 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 92 transitions, 693 flow [2022-12-13 06:23:28,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-13 06:23:28,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:28,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:28,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:23:28,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1135756110, now seen corresponding path program 1 times [2022-12-13 06:23:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:28,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843119302] [2022-12-13 06:23:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:28,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843119302] [2022-12-13 06:23:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843119302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:28,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:28,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698934169] [2022-12-13 06:23:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:28,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:28,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:28,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 06:23:28,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 92 transitions, 693 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-12-13 06:23:28,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:28,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 06:23:28,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:28,980 INFO L130 PetriNetUnfolder]: 1769/2716 cut-off events. [2022-12-13 06:23:28,981 INFO L131 PetriNetUnfolder]: For 2235/2235 co-relation queries the response was YES. [2022-12-13 06:23:28,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 2716 events. 1769/2716 cut-off events. For 2235/2235 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13452 event pairs, 73 based on Foata normal form. 20/2331 useless extension candidates. Maximal degree in co-relation 12517. Up to 2130 conditions per place. [2022-12-13 06:23:29,007 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 32 changer transitions 0/164 dead transitions. [2022-12-13 06:23:29,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 06:23:29,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.675 [2022-12-13 06:23:29,011 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-13 06:23:29,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:29,058 INFO L89 Accepts]: Start accepts. Operand has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:29,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:29,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 944 [2022-12-13 06:23:29,076 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:29,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 06:23:29,083 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 164 transitions, 1571 flow [2022-12-13 06:23:29,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-12-13 06:23:29,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:29,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:29,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:23:29,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:29,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1135488270, now seen corresponding path program 2 times [2022-12-13 06:23:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:29,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105127875] [2022-12-13 06:23:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:29,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105127875] [2022-12-13 06:23:29,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105127875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:29,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:29,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716763907] [2022-12-13 06:23:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:29,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:23:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:23:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:23:29,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 06:23:29,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 164 transitions, 1571 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-13 06:23:29,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:29,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 06:23:29,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:30,042 INFO L130 PetriNetUnfolder]: 2964/4558 cut-off events. [2022-12-13 06:23:30,043 INFO L131 PetriNetUnfolder]: For 7210/7232 co-relation queries the response was YES. [2022-12-13 06:23:30,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24671 conditions, 4558 events. 2964/4558 cut-off events. For 7210/7232 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24636 event pairs, 60 based on Foata normal form. 177/4047 useless extension candidates. Maximal degree in co-relation 24648. Up to 3627 conditions per place. [2022-12-13 06:23:30,071 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 121 selfloop transitions, 5 changer transitions 138/274 dead transitions. [2022-12-13 06:23:30,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 274 transitions, 3197 flow [2022-12-13 06:23:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 06:23:30,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7109375 [2022-12-13 06:23:30,073 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-13 06:23:30,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 274 transitions, 3197 flow [2022-12-13 06:23:30,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 136 transitions, 1539 flow [2022-12-13 06:23:30,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:30,141 INFO L89 Accepts]: Start accepts. Operand has 55 places, 136 transitions, 1539 flow [2022-12-13 06:23:30,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:30,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:30,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 136 transitions, 1539 flow [2022-12-13 06:23:30,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 136 transitions, 1539 flow [2022-12-13 06:23:30,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-13 06:23:30,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:30,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 06:23:30,385 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 136 transitions, 1539 flow [2022-12-13 06:23:30,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-13 06:23:30,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:30,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:30,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:23:30,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1419091325, now seen corresponding path program 1 times [2022-12-13 06:23:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:30,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666598377] [2022-12-13 06:23:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:30,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666598377] [2022-12-13 06:23:30,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666598377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:30,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:30,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585765143] [2022-12-13 06:23:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:23:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:23:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:23:30,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 06:23:30,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 136 transitions, 1539 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-13 06:23:30,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:30,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 06:23:30,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:31,154 INFO L130 PetriNetUnfolder]: 1887/2986 cut-off events. [2022-12-13 06:23:31,154 INFO L131 PetriNetUnfolder]: For 3541/3541 co-relation queries the response was YES. [2022-12-13 06:23:31,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19244 conditions, 2986 events. 1887/2986 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15426 event pairs, 64 based on Foata normal form. 100/2564 useless extension candidates. Maximal degree in co-relation 19218. Up to 2476 conditions per place. [2022-12-13 06:23:31,172 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 55 selfloop transitions, 3 changer transitions 81/147 dead transitions. [2022-12-13 06:23:31,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 147 transitions, 1945 flow [2022-12-13 06:23:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 06:23:31,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6397058823529411 [2022-12-13 06:23:31,174 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-13 06:23:31,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 147 transitions, 1945 flow [2022-12-13 06:23:31,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 66 transitions, 847 flow [2022-12-13 06:23:31,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:31,213 INFO L89 Accepts]: Start accepts. Operand has 56 places, 66 transitions, 847 flow [2022-12-13 06:23:31,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:31,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:31,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 66 transitions, 847 flow [2022-12-13 06:23:31,217 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 66 transitions, 847 flow [2022-12-13 06:23:31,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-13 06:23:32,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:32,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 915 [2022-12-13 06:23:32,128 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 66 transitions, 847 flow [2022-12-13 06:23:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-13 06:23:32,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:32,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:32,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:23:32,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash -490103878, now seen corresponding path program 1 times [2022-12-13 06:23:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:32,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355747586] [2022-12-13 06:23:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:32,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:32,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355747586] [2022-12-13 06:23:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355747586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:32,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085969350] [2022-12-13 06:23:32,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:32,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:23:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:23:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:23:32,628 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 06:23:32,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 66 transitions, 847 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-13 06:23:32,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:32,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 06:23:32,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:32,871 INFO L130 PetriNetUnfolder]: 885/1426 cut-off events. [2022-12-13 06:23:32,871 INFO L131 PetriNetUnfolder]: For 1228/1228 co-relation queries the response was YES. [2022-12-13 06:23:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10727 conditions, 1426 events. 885/1426 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6260 event pairs, 63 based on Foata normal form. 2/1152 useless extension candidates. Maximal degree in co-relation 10698. Up to 1277 conditions per place. [2022-12-13 06:23:32,889 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 71 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2022-12-13 06:23:32,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 06:23:32,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2022-12-13 06:23:32,892 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-13 06:23:32,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:32,926 INFO L89 Accepts]: Start accepts. Operand has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:32,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:32,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-13 06:23:32,937 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:32,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 06:23:32,938 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 88 transitions, 1323 flow [2022-12-13 06:23:32,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-13 06:23:32,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:32,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:32,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:23:32,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1883617233, now seen corresponding path program 1 times [2022-12-13 06:23:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:32,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630328753] [2022-12-13 06:23:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630328753] [2022-12-13 06:23:33,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630328753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:33,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:33,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:33,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513087268] [2022-12-13 06:23:33,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:33,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:33,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:33,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 06:23:33,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 88 transitions, 1323 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-13 06:23:33,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:33,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 06:23:33,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:33,525 INFO L130 PetriNetUnfolder]: 1619/2538 cut-off events. [2022-12-13 06:23:33,525 INFO L131 PetriNetUnfolder]: For 11516/11636 co-relation queries the response was YES. [2022-12-13 06:23:33,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19739 conditions, 2538 events. 1619/2538 cut-off events. For 11516/11636 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12754 event pairs, 221 based on Foata normal form. 193/2281 useless extension candidates. Maximal degree in co-relation 19707. Up to 2070 conditions per place. [2022-12-13 06:23:33,547 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 78 selfloop transitions, 18 changer transitions 63/167 dead transitions. [2022-12-13 06:23:33,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 167 transitions, 2791 flow [2022-12-13 06:23:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 06:23:33,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2022-12-13 06:23:33,549 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -13 predicate places. [2022-12-13 06:23:33,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 167 transitions, 2791 flow [2022-12-13 06:23:33,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 104 transitions, 1741 flow [2022-12-13 06:23:33,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:33,588 INFO L89 Accepts]: Start accepts. Operand has 60 places, 104 transitions, 1741 flow [2022-12-13 06:23:33,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:33,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:33,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 104 transitions, 1741 flow [2022-12-13 06:23:33,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 104 transitions, 1741 flow [2022-12-13 06:23:33,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 06:23:33,596 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:33,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 06:23:33,597 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 104 transitions, 1741 flow [2022-12-13 06:23:33,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-13 06:23:33,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:33,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:33,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:23:33,597 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash -827862667, now seen corresponding path program 1 times [2022-12-13 06:23:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:33,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524260245] [2022-12-13 06:23:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:33,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524260245] [2022-12-13 06:23:33,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524260245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:33,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:33,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:23:33,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032471825] [2022-12-13 06:23:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:33,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:23:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:33,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:23:33,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:23:33,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 06:23:33,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 104 transitions, 1741 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-12-13 06:23:33,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:33,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 06:23:33,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:34,147 INFO L130 PetriNetUnfolder]: 939/1634 cut-off events. [2022-12-13 06:23:34,148 INFO L131 PetriNetUnfolder]: For 7795/7913 co-relation queries the response was YES. [2022-12-13 06:23:34,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14321 conditions, 1634 events. 939/1634 cut-off events. For 7795/7913 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8614 event pairs, 93 based on Foata normal form. 211/1579 useless extension candidates. Maximal degree in co-relation 14286. Up to 1465 conditions per place. [2022-12-13 06:23:34,161 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 76 selfloop transitions, 31 changer transitions 37/152 dead transitions. [2022-12-13 06:23:34,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 152 transitions, 2770 flow [2022-12-13 06:23:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:23:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:23:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-13 06:23:34,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 06:23:34,164 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -10 predicate places. [2022-12-13 06:23:34,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 152 transitions, 2770 flow [2022-12-13 06:23:34,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 115 transitions, 2114 flow [2022-12-13 06:23:34,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:34,191 INFO L89 Accepts]: Start accepts. Operand has 63 places, 115 transitions, 2114 flow [2022-12-13 06:23:34,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:34,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:34,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 115 transitions, 2114 flow [2022-12-13 06:23:34,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 115 transitions, 2114 flow [2022-12-13 06:23:34,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-13 06:23:34,199 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:34,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:23:34,199 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 115 transitions, 2114 flow [2022-12-13 06:23:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-12-13 06:23:34,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:34,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:34,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:23:34,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash -467484033, now seen corresponding path program 1 times [2022-12-13 06:23:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:34,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667347789] [2022-12-13 06:23:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:34,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667347789] [2022-12-13 06:23:34,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667347789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:34,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:34,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:23:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402729242] [2022-12-13 06:23:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:34,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:23:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:23:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:23:34,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 06:23:34,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 115 transitions, 2114 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-13 06:23:34,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:34,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 06:23:34,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:34,648 INFO L130 PetriNetUnfolder]: 486/919 cut-off events. [2022-12-13 06:23:34,648 INFO L131 PetriNetUnfolder]: For 4897/4951 co-relation queries the response was YES. [2022-12-13 06:23:34,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8931 conditions, 919 events. 486/919 cut-off events. For 4897/4951 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4462 event pairs, 15 based on Foata normal form. 138/907 useless extension candidates. Maximal degree in co-relation 8893. Up to 785 conditions per place. [2022-12-13 06:23:34,657 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 64 selfloop transitions, 40 changer transitions 15/127 dead transitions. [2022-12-13 06:23:34,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 2550 flow [2022-12-13 06:23:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:23:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:23:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-13 06:23:34,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-13 06:23:34,660 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2022-12-13 06:23:34,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 127 transitions, 2550 flow [2022-12-13 06:23:34,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 112 transitions, 2262 flow [2022-12-13 06:23:34,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:34,679 INFO L89 Accepts]: Start accepts. Operand has 66 places, 112 transitions, 2262 flow [2022-12-13 06:23:34,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:34,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:34,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 112 transitions, 2262 flow [2022-12-13 06:23:34,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 112 transitions, 2262 flow [2022-12-13 06:23:34,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-13 06:23:36,108 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:36,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1430 [2022-12-13 06:23:36,109 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 111 transitions, 2240 flow [2022-12-13 06:23:36,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-13 06:23:36,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:36,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:23:36,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -824976668, now seen corresponding path program 1 times [2022-12-13 06:23:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:36,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557074624] [2022-12-13 06:23:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:37,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:37,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557074624] [2022-12-13 06:23:37,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557074624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:37,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:37,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:23:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628609107] [2022-12-13 06:23:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:37,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:23:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:37,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:23:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:23:37,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 06:23:37,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 111 transitions, 2240 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-12-13 06:23:37,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:37,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 06:23:37,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:37,785 INFO L130 PetriNetUnfolder]: 523/928 cut-off events. [2022-12-13 06:23:37,785 INFO L131 PetriNetUnfolder]: For 7041/7083 co-relation queries the response was YES. [2022-12-13 06:23:37,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9539 conditions, 928 events. 523/928 cut-off events. For 7041/7083 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4285 event pairs, 0 based on Foata normal form. 35/773 useless extension candidates. Maximal degree in co-relation 9498. Up to 803 conditions per place. [2022-12-13 06:23:37,792 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 66 selfloop transitions, 7 changer transitions 51/137 dead transitions. [2022-12-13 06:23:37,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 137 transitions, 3056 flow [2022-12-13 06:23:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 06:23:37,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2022-12-13 06:23:37,794 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2022-12-13 06:23:37,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 137 transitions, 3056 flow [2022-12-13 06:23:37,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 86 transitions, 1855 flow [2022-12-13 06:23:37,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:37,811 INFO L89 Accepts]: Start accepts. Operand has 67 places, 86 transitions, 1855 flow [2022-12-13 06:23:37,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:37,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:37,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 86 transitions, 1855 flow [2022-12-13 06:23:37,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 86 transitions, 1855 flow [2022-12-13 06:23:37,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 06:23:37,818 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:37,819 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 06:23:37,819 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 86 transitions, 1855 flow [2022-12-13 06:23:37,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-12-13 06:23:37,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:37,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:37,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:23:37,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 06:23:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1335472670, now seen corresponding path program 2 times [2022-12-13 06:23:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:37,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136285145] [2022-12-13 06:23:37,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:37,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:23:37,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:23:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:23:37,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:23:37,965 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:23:37,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 06:23:37,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 06:23:37,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 06:23:37,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 06:23:37,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 06:23:37,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 06:23:37,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:23:37,972 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:37,977 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:23:37,977 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:23:38,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:23:38 BasicIcfg [2022-12-13 06:23:38,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:23:38,067 INFO L158 Benchmark]: Toolchain (without parser) took 24253.76ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 883.9MB). Free memory was 131.7MB in the beginning and 532.4MB in the end (delta: -400.8MB). Peak memory consumption was 484.2MB. Max. memory is 8.0GB. [2022-12-13 06:23:38,068 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:23:38,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.10ms. Allocated memory is still 172.0MB. Free memory was 131.2MB in the beginning and 105.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 06:23:38,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.54ms. Allocated memory is still 172.0MB. Free memory was 105.0MB in the beginning and 102.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:38,068 INFO L158 Benchmark]: Boogie Preprocessor took 41.55ms. Allocated memory is still 172.0MB. Free memory was 102.3MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 06:23:38,068 INFO L158 Benchmark]: RCFGBuilder took 694.87ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 65.6MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 06:23:38,069 INFO L158 Benchmark]: TraceAbstraction took 22875.35ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 883.9MB). Free memory was 64.6MB in the beginning and 532.4MB in the end (delta: -467.9MB). Peak memory consumption was 417.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:38,070 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.12ms. Allocated memory is still 172.0MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.10ms. Allocated memory is still 172.0MB. Free memory was 131.2MB in the beginning and 105.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.54ms. Allocated memory is still 172.0MB. Free memory was 105.0MB in the beginning and 102.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.55ms. Allocated memory is still 172.0MB. Free memory was 102.3MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 694.87ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 65.6MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 22875.35ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 883.9MB). Free memory was 64.6MB in the beginning and 532.4MB in the end (delta: -467.9MB). Peak memory consumption was 417.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 113 PlacesBefore, 75 PlacesAfterwards, 105 TransitionsBefore, 66 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 5 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3701, independent: 3576, independent conditional: 3576, independent unconditional: 0, dependent: 125, dependent conditional: 125, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3701, independent: 3576, independent conditional: 0, independent unconditional: 3576, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3701, independent: 3576, independent conditional: 0, independent unconditional: 3576, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3701, independent: 3576, independent conditional: 0, independent unconditional: 3576, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1920, independent: 1872, independent conditional: 0, independent unconditional: 1872, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1920, independent: 1844, independent conditional: 0, independent unconditional: 1844, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 357, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3701, independent: 1704, independent conditional: 0, independent unconditional: 1704, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1920, unknown conditional: 0, unknown unconditional: 1920] , Statistics on independence cache: Total cache size (in pairs): 3630, Positive cache size: 3582, Positive conditional cache size: 0, Positive unconditional cache size: 3582, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121, independent: 113, independent conditional: 32, independent unconditional: 81, dependent: 8, dependent conditional: 7, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, independent: 113, independent conditional: 16, independent unconditional: 97, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, independent: 113, independent conditional: 16, independent unconditional: 97, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 57, independent conditional: 6, independent unconditional: 51, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 14, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, independent: 56, independent conditional: 10, independent unconditional: 46, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 62, unknown conditional: 8, unknown unconditional: 54] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 57, Positive conditional cache size: 6, Positive unconditional cache size: 51, Negative cache size: 5, Negative conditional cache size: 2, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 50, independent conditional: 16, independent unconditional: 34, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 50, independent conditional: 2, independent unconditional: 48, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 50, independent conditional: 2, independent unconditional: 48, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 43, independent conditional: 2, independent unconditional: 41, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 64, Positive conditional cache size: 6, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, independent: 239, independent conditional: 239, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 252, independent: 239, independent conditional: 94, independent unconditional: 145, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 265, independent: 239, independent conditional: 18, independent unconditional: 221, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 265, independent: 239, independent conditional: 18, independent unconditional: 221, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 265, independent: 228, independent conditional: 18, independent unconditional: 210, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 75, Positive conditional cache size: 6, Positive unconditional cache size: 69, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 102, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 68, independent unconditional: 34, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 75, Positive conditional cache size: 6, Positive unconditional cache size: 69, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 119, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 55 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 82, Positive conditional cache size: 6, Positive unconditional cache size: 76, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 56 PlacesBefore, 56 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 89, Positive conditional cache size: 8, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 89, Positive conditional cache size: 8, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 89, Positive conditional cache size: 8, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 89, Positive conditional cache size: 8, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 66 PlacesBefore, 65 PlacesAfterwards, 112 TransitionsBefore, 111 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 91, Positive conditional cache size: 8, Positive unconditional cache size: 83, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 91, Positive conditional cache size: 8, Positive unconditional cache size: 83, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-2, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-1, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 823]: 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: 821]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 900 IncrementalHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 11 mSDtfsCounter, 900 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2262occurred in iteration=10, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-12-13 06:23:38,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...