/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:45:44,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:45:44,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:45:45,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:45:45,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:45:45,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:45:45,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:45:45,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:45:45,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:45:45,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:45:45,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:45:45,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:45:45,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:45:45,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:45:45,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:45:45,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:45:45,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:45:45,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:45:45,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:45:45,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:45:45,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:45:45,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:45:45,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:45:45,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:45:45,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:45:45,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:45:45,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:45:45,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:45:45,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:45:45,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:45:45,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:45:45,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:45:45,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:45:45,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:45:45,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:45:45,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:45:45,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:45:45,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:45:45,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:45:45,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:45:45,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:45:45,077 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 00:45:45,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:45:45,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:45:45,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:45:45,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:45:45,108 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:45:45,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:45:45,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:45:45,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:45:45,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:45:45,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:45:45,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:45:45,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:45:45,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:45:45,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:45:45,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:45:45,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:45:45,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:45:45,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:45:45,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:45:45,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:45:45,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:45:45,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:45:45,112 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 [2022-12-13 00:45:45,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:45:45,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:45:45,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:45:45,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:45:45,441 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:45:45,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:45:46,519 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:45:46,758 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:45:46,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:45:46,772 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3842190f4/0ac8862d0a0a47fa880edca64648cf8b/FLAGc1e8a8526 [2022-12-13 00:45:46,785 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3842190f4/0ac8862d0a0a47fa880edca64648cf8b [2022-12-13 00:45:46,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:45:46,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:45:46,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:45:46,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:45:46,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:45:46,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:45:46" (1/1) ... [2022-12-13 00:45:46,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49257e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:46, skipping insertion in model container [2022-12-13 00:45:46,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:45:46" (1/1) ... [2022-12-13 00:45:46,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:45:46,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:45:47,028 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 00:45:47,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:45:47,222 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:45:47,235 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 00:45:47,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:47,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:47,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:45:47,340 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:45:47,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47 WrapperNode [2022-12-13 00:45:47,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:45:47,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:45:47,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:45:47,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:45:47,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,392 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 00:45:47,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:45:47,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:45:47,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:45:47,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:45:47,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:45:47,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:45:47,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:45:47,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:45:47,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (1/1) ... [2022-12-13 00:45:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:45:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:45:47,472 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 00:45:47,491 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 00:45:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:45:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:45:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:45:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:45:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:45:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:45:47,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:45:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:45:47,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:45:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:45:47,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:45:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:45:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:45:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:45:47,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:45:47,517 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 00:45:47,625 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:45:47,626 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:45:47,950 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:45:48,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:45:48,124 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:45:48,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:45:48 BoogieIcfgContainer [2022-12-13 00:45:48,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:45:48,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:45:48,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:45:48,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:45:48,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:45:46" (1/3) ... [2022-12-13 00:45:48,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe73a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:45:48, skipping insertion in model container [2022-12-13 00:45:48,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:47" (2/3) ... [2022-12-13 00:45:48,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe73a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:45:48, skipping insertion in model container [2022-12-13 00:45:48,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:45:48" (3/3) ... [2022-12-13 00:45:48,155 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:45:48,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:45:48,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:45:48,170 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:45:48,228 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:45:48,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 00:45:48,327 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 00:45:48,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:48,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:45:48,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 00:45:48,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-13 00:45:48,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:48,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 00:45:48,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-13 00:45:48,382 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 00:45:48,382 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:48,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:45:48,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 00:45:48,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 00:45:53,446 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 00:45:53,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:45:53,473 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;@106d424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:45:53,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:45:53,475 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:45:53,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:53,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:53,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:45:53,476 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 00:45:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 486866, now seen corresponding path program 1 times [2022-12-13 00:45:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:53,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427529178] [2022-12-13 00:45:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:53,888 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 00:45:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427529178] [2022-12-13 00:45:53,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427529178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:53,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:53,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:45:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019126719] [2022-12-13 00:45:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:53,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:53,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2022-12-13 00:45:53,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 139 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 00:45:53,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:53,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2022-12-13 00:45:53,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:55,614 INFO L130 PetriNetUnfolder]: 9240/14824 cut-off events. [2022-12-13 00:45:55,614 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 00:45:55,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28062 conditions, 14824 events. 9240/14824 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 112379 event pairs, 1220 based on Foata normal form. 0/9362 useless extension candidates. Maximal degree in co-relation 28051. Up to 11165 conditions per place. [2022-12-13 00:45:55,675 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 36 selfloop transitions, 2 changer transitions 59/108 dead transitions. [2022-12-13 00:45:55,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-13 00:45:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-12-13 00:45:55,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 00:45:55,688 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 139 flow. Second operand 3 states and 135 transitions. [2022-12-13 00:45:55,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 423 flow [2022-12-13 00:45:55,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:45:55,694 INFO L231 Difference]: Finished difference. Result has 72 places, 33 transitions, 76 flow [2022-12-13 00:45:55,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=72, PETRI_TRANSITIONS=33} [2022-12-13 00:45:55,699 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-13 00:45:55,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:55,700 INFO L89 Accepts]: Start accepts. Operand has 72 places, 33 transitions, 76 flow [2022-12-13 00:45:55,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:55,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:55,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 33 transitions, 76 flow [2022-12-13 00:45:55,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 00:45:55,722 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:45:55,723 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:55,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 90 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:45:55,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 00:45:55,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 00:45:55,836 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:55,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 00:45:55,838 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 00:45:55,839 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 00:45:55,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:55,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:55,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:45:55,839 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 00:45:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash -389709415, now seen corresponding path program 1 times [2022-12-13 00:45:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:55,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41691003] [2022-12-13 00:45:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:56,077 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 00:45:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:56,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41691003] [2022-12-13 00:45:56,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41691003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:56,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:56,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:45:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803756175] [2022-12-13 00:45:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:56,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:56,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:45:56,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 00:45:56,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:56,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:45:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:56,798 INFO L130 PetriNetUnfolder]: 4255/6560 cut-off events. [2022-12-13 00:45:56,798 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-13 00:45:56,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 6560 events. 4255/6560 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 38630 event pairs, 1469 based on Foata normal form. 0/5342 useless extension candidates. Maximal degree in co-relation 13183. Up to 3195 conditions per place. [2022-12-13 00:45:56,834 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 6 changer transitions 2/53 dead transitions. [2022-12-13 00:45:56,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 210 flow [2022-12-13 00:45:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 00:45:56,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 00:45:56,837 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 70 transitions. [2022-12-13 00:45:56,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 210 flow [2022-12-13 00:45:56,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:56,840 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 116 flow [2022-12-13 00:45:56,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 00:45:56,841 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -31 predicate places. [2022-12-13 00:45:56,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:56,841 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 116 flow [2022-12-13 00:45:56,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:56,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:56,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 116 flow [2022-12-13 00:45:56,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 116 flow [2022-12-13 00:45:56,863 INFO L130 PetriNetUnfolder]: 48/253 cut-off events. [2022-12-13 00:45:56,863 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 00:45:56,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 253 events. 48/253 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1706 event pairs, 18 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 402. Up to 61 conditions per place. [2022-12-13 00:45:56,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 116 flow [2022-12-13 00:45:56,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 00:45:56,926 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:56,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 00:45:56,928 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 116 flow [2022-12-13 00:45:56,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 00:45:56,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:56,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:56,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:45:56,929 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 00:45:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash 803907954, now seen corresponding path program 1 times [2022-12-13 00:45:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:56,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134766754] [2022-12-13 00:45:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:57,078 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 00:45:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:57,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134766754] [2022-12-13 00:45:57,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134766754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:57,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:57,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992345161] [2022-12-13 00:45:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:57,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:45:57,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 00:45:57,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:57,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:45:57,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:57,591 INFO L130 PetriNetUnfolder]: 3254/5155 cut-off events. [2022-12-13 00:45:57,591 INFO L131 PetriNetUnfolder]: For 1708/1708 co-relation queries the response was YES. [2022-12-13 00:45:57,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11981 conditions, 5155 events. 3254/5155 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 30064 event pairs, 234 based on Foata normal form. 6/4342 useless extension candidates. Maximal degree in co-relation 11969. Up to 2405 conditions per place. [2022-12-13 00:45:57,619 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 45 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2022-12-13 00:45:57,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 300 flow [2022-12-13 00:45:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:45:57,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 00:45:57,623 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 116 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:45:57,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 300 flow [2022-12-13 00:45:57,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:57,633 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 172 flow [2022-12-13 00:45:57,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 00:45:57,634 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-13 00:45:57,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:57,634 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 172 flow [2022-12-13 00:45:57,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:57,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:57,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 172 flow [2022-12-13 00:45:57,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 172 flow [2022-12-13 00:45:57,654 INFO L130 PetriNetUnfolder]: 41/225 cut-off events. [2022-12-13 00:45:57,654 INFO L131 PetriNetUnfolder]: For 92/102 co-relation queries the response was YES. [2022-12-13 00:45:57,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 225 events. 41/225 cut-off events. For 92/102 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1454 event pairs, 11 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 417. Up to 54 conditions per place. [2022-12-13 00:45:57,657 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 172 flow [2022-12-13 00:45:57,657 INFO L226 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-13 00:45:57,679 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:57,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 00:45:57,680 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 172 flow [2022-12-13 00:45:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 00:45:57,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:57,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:45:57,681 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 00:45:57,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 803909628, now seen corresponding path program 1 times [2022-12-13 00:45:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:57,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852321311] [2022-12-13 00:45:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:57,780 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 00:45:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852321311] [2022-12-13 00:45:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852321311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:57,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:57,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898600916] [2022-12-13 00:45:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:57,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:57,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:45:57,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 00:45:57,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:57,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:45:57,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:58,291 INFO L130 PetriNetUnfolder]: 3195/5052 cut-off events. [2022-12-13 00:45:58,291 INFO L131 PetriNetUnfolder]: For 3322/3322 co-relation queries the response was YES. [2022-12-13 00:45:58,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12589 conditions, 5052 events. 3195/5052 cut-off events. For 3322/3322 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29408 event pairs, 477 based on Foata normal form. 10/4254 useless extension candidates. Maximal degree in co-relation 12574. Up to 2357 conditions per place. [2022-12-13 00:45:58,323 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 50 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2022-12-13 00:45:58,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 388 flow [2022-12-13 00:45:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 00:45:58,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703125 [2022-12-13 00:45:58,325 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 172 flow. Second operand 4 states and 90 transitions. [2022-12-13 00:45:58,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 388 flow [2022-12-13 00:45:58,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:45:58,333 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 254 flow [2022-12-13 00:45:58,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-12-13 00:45:58,334 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-13 00:45:58,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:58,335 INFO L89 Accepts]: Start accepts. Operand has 52 places, 47 transitions, 254 flow [2022-12-13 00:45:58,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:58,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:58,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 47 transitions, 254 flow [2022-12-13 00:45:58,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 47 transitions, 254 flow [2022-12-13 00:45:58,353 INFO L130 PetriNetUnfolder]: 35/207 cut-off events. [2022-12-13 00:45:58,354 INFO L131 PetriNetUnfolder]: For 230/254 co-relation queries the response was YES. [2022-12-13 00:45:58,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 207 events. 35/207 cut-off events. For 230/254 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1299 event pairs, 5 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 456. Up to 46 conditions per place. [2022-12-13 00:45:58,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 47 transitions, 254 flow [2022-12-13 00:45:58,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-13 00:45:58,359 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:58,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 00:45:58,360 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 254 flow [2022-12-13 00:45:58,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 00:45:58,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:58,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:58,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:45:58,361 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 00:45:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash -848657597, now seen corresponding path program 1 times [2022-12-13 00:45:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:58,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183796153] [2022-12-13 00:45:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:58,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 00:45:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:58,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183796153] [2022-12-13 00:45:58,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183796153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:58,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:58,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053502657] [2022-12-13 00:45:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:58,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:58,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:58,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:45:58,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 00:45:58,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:58,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:45:58,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:59,029 INFO L130 PetriNetUnfolder]: 3508/5598 cut-off events. [2022-12-13 00:45:59,029 INFO L131 PetriNetUnfolder]: For 5567/5633 co-relation queries the response was YES. [2022-12-13 00:45:59,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14455 conditions, 5598 events. 3508/5598 cut-off events. For 5567/5633 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 33654 event pairs, 941 based on Foata normal form. 132/4067 useless extension candidates. Maximal degree in co-relation 14436. Up to 5242 conditions per place. [2022-12-13 00:45:59,052 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 49 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2022-12-13 00:45:59,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 488 flow [2022-12-13 00:45:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 00:45:59,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2022-12-13 00:45:59,054 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 254 flow. Second operand 3 states and 67 transitions. [2022-12-13 00:45:59,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 488 flow [2022-12-13 00:45:59,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 486 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 00:45:59,066 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 320 flow [2022-12-13 00:45:59,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 00:45:59,066 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-13 00:45:59,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:59,067 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 320 flow [2022-12-13 00:45:59,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:59,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:59,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 320 flow [2022-12-13 00:45:59,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 320 flow [2022-12-13 00:45:59,202 INFO L130 PetriNetUnfolder]: 868/1863 cut-off events. [2022-12-13 00:45:59,202 INFO L131 PetriNetUnfolder]: For 867/911 co-relation queries the response was YES. [2022-12-13 00:45:59,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1863 events. 868/1863 cut-off events. For 867/911 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 15612 event pairs, 393 based on Foata normal form. 3/1055 useless extension candidates. Maximal degree in co-relation 4006. Up to 1297 conditions per place. [2022-12-13 00:45:59,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 320 flow [2022-12-13 00:45:59,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-13 00:45:59,240 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:59,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-13 00:45:59,241 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 320 flow [2022-12-13 00:45:59,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 00:45:59,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:59,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:59,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:45:59,242 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 00:45:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1306727331, now seen corresponding path program 1 times [2022-12-13 00:45:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:59,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336967551] [2022-12-13 00:45:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:59,372 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 00:45:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:59,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336967551] [2022-12-13 00:45:59,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336967551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:59,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:59,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611623470] [2022-12-13 00:45:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:59,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:59,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:45:59,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 00:45:59,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:59,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:45:59,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:00,120 INFO L130 PetriNetUnfolder]: 5250/8531 cut-off events. [2022-12-13 00:46:00,120 INFO L131 PetriNetUnfolder]: For 11044/11246 co-relation queries the response was YES. [2022-12-13 00:46:00,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26173 conditions, 8531 events. 5250/8531 cut-off events. For 11044/11246 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 58123 event pairs, 1522 based on Foata normal form. 223/7125 useless extension candidates. Maximal degree in co-relation 26151. Up to 4776 conditions per place. [2022-12-13 00:46:00,163 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 71 selfloop transitions, 15 changer transitions 4/101 dead transitions. [2022-12-13 00:46:00,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 689 flow [2022-12-13 00:46:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 00:46:00,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.734375 [2022-12-13 00:46:00,169 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 320 flow. Second operand 4 states and 94 transitions. [2022-12-13 00:46:00,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 689 flow [2022-12-13 00:46:00,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:46:00,184 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 390 flow [2022-12-13 00:46:00,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-12-13 00:46:00,187 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -15 predicate places. [2022-12-13 00:46:00,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:00,187 INFO L89 Accepts]: Start accepts. Operand has 60 places, 57 transitions, 390 flow [2022-12-13 00:46:00,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:00,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:00,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 57 transitions, 390 flow [2022-12-13 00:46:00,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 57 transitions, 390 flow [2022-12-13 00:46:00,349 INFO L130 PetriNetUnfolder]: 1297/2591 cut-off events. [2022-12-13 00:46:00,350 INFO L131 PetriNetUnfolder]: For 1461/1505 co-relation queries the response was YES. [2022-12-13 00:46:00,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 2591 events. 1297/2591 cut-off events. For 1461/1505 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 21853 event pairs, 633 based on Foata normal form. 3/1280 useless extension candidates. Maximal degree in co-relation 5589. Up to 2137 conditions per place. [2022-12-13 00:46:00,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 57 transitions, 390 flow [2022-12-13 00:46:00,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 1016 [2022-12-13 00:46:00,388 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:00,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 00:46:00,389 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 390 flow [2022-12-13 00:46:00,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 00:46:00,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:00,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:00,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:46:00,389 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 00:46:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash -510553007, now seen corresponding path program 1 times [2022-12-13 00:46:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:00,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743975141] [2022-12-13 00:46:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:00,490 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 00:46:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:00,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743975141] [2022-12-13 00:46:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743975141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:00,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:00,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561641609] [2022-12-13 00:46:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:00,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:00,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:46:00,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 390 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 00:46:00,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:00,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:46:00,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:00,949 INFO L130 PetriNetUnfolder]: 2562/4685 cut-off events. [2022-12-13 00:46:00,949 INFO L131 PetriNetUnfolder]: For 6464/6510 co-relation queries the response was YES. [2022-12-13 00:46:00,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14767 conditions, 4685 events. 2562/4685 cut-off events. For 6464/6510 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 33051 event pairs, 352 based on Foata normal form. 339/3524 useless extension candidates. Maximal degree in co-relation 14741. Up to 3448 conditions per place. [2022-12-13 00:46:00,972 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 62 selfloop transitions, 19 changer transitions 1/96 dead transitions. [2022-12-13 00:46:00,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 807 flow [2022-12-13 00:46:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 00:46:00,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 00:46:00,973 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 390 flow. Second operand 4 states and 92 transitions. [2022-12-13 00:46:00,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 807 flow [2022-12-13 00:46:00,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 797 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 00:46:00,983 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 496 flow [2022-12-13 00:46:00,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=496, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-13 00:46:00,984 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2022-12-13 00:46:00,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:00,984 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 496 flow [2022-12-13 00:46:00,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:00,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:00,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 496 flow [2022-12-13 00:46:00,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 496 flow [2022-12-13 00:46:01,136 INFO L130 PetriNetUnfolder]: 763/1916 cut-off events. [2022-12-13 00:46:01,136 INFO L131 PetriNetUnfolder]: For 1241/1659 co-relation queries the response was YES. [2022-12-13 00:46:01,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5783 conditions, 1916 events. 763/1916 cut-off events. For 1241/1659 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 17476 event pairs, 144 based on Foata normal form. 13/1113 useless extension candidates. Maximal degree in co-relation 5757. Up to 1420 conditions per place. [2022-12-13 00:46:01,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 496 flow [2022-12-13 00:46:01,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 1010 [2022-12-13 00:46:01,235 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:01,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-13 00:46:01,236 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 496 flow [2022-12-13 00:46:01,236 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 00:46:01,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:01,237 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 00:46:01,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:46:01,237 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 00:46:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 845894646, now seen corresponding path program 1 times [2022-12-13 00:46:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:01,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972904240] [2022-12-13 00:46:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:01,398 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 00:46:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:01,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972904240] [2022-12-13 00:46:01,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972904240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:01,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:01,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029605005] [2022-12-13 00:46:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:01,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:46:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:46:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:46:01,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:46:01,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:46:01,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:01,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:46:01,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:01,673 INFO L130 PetriNetUnfolder]: 1428/2723 cut-off events. [2022-12-13 00:46:01,674 INFO L131 PetriNetUnfolder]: For 4158/4194 co-relation queries the response was YES. [2022-12-13 00:46:01,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 2723 events. 1428/2723 cut-off events. For 4158/4194 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18013 event pairs, 109 based on Foata normal form. 345/2090 useless extension candidates. Maximal degree in co-relation 10902. Up to 1543 conditions per place. [2022-12-13 00:46:01,684 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 44 selfloop transitions, 28 changer transitions 16/96 dead transitions. [2022-12-13 00:46:01,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 873 flow [2022-12-13 00:46:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:46:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:46:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 00:46:01,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61875 [2022-12-13 00:46:01,686 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 496 flow. Second operand 5 states and 99 transitions. [2022-12-13 00:46:01,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 873 flow [2022-12-13 00:46:01,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 831 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:01,695 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 442 flow [2022-12-13 00:46:01,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2022-12-13 00:46:01,696 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2022-12-13 00:46:01,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:01,696 INFO L89 Accepts]: Start accepts. Operand has 67 places, 57 transitions, 442 flow [2022-12-13 00:46:01,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:01,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:01,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 57 transitions, 442 flow [2022-12-13 00:46:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 442 flow [2022-12-13 00:46:01,732 INFO L130 PetriNetUnfolder]: 194/530 cut-off events. [2022-12-13 00:46:01,732 INFO L131 PetriNetUnfolder]: For 422/620 co-relation queries the response was YES. [2022-12-13 00:46:01,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 530 events. 194/530 cut-off events. For 422/620 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3632 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 1904. Up to 379 conditions per place. [2022-12-13 00:46:01,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 442 flow [2022-12-13 00:46:01,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-13 00:46:02,256 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:46:02,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 561 [2022-12-13 00:46:02,258 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 438 flow [2022-12-13 00:46:02,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:46:02,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:02,258 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 00:46:02,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:46:02,258 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 00:46:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1072803595, now seen corresponding path program 1 times [2022-12-13 00:46:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:02,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983938226] [2022-12-13 00:46:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:02,939 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 00:46:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983938226] [2022-12-13 00:46:02,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983938226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:02,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:02,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:46:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383398436] [2022-12-13 00:46:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:02,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:46:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:02,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:46:02,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:46:02,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 00:46:02,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 00:46:02,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:02,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 00:46:02,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:03,260 INFO L130 PetriNetUnfolder]: 855/1558 cut-off events. [2022-12-13 00:46:03,260 INFO L131 PetriNetUnfolder]: For 3815/3909 co-relation queries the response was YES. [2022-12-13 00:46:03,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 1558 events. 855/1558 cut-off events. For 3815/3909 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 9422 event pairs, 37 based on Foata normal form. 81/1259 useless extension candidates. Maximal degree in co-relation 6756. Up to 888 conditions per place. [2022-12-13 00:46:03,269 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 49 selfloop transitions, 4 changer transitions 39/107 dead transitions. [2022-12-13 00:46:03,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 987 flow [2022-12-13 00:46:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:46:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:46:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 00:46:03,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2022-12-13 00:46:03,271 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 438 flow. Second operand 6 states and 106 transitions. [2022-12-13 00:46:03,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 987 flow [2022-12-13 00:46:03,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 764 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-12-13 00:46:03,300 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 319 flow [2022-12-13 00:46:03,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 00:46:03,300 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2022-12-13 00:46:03,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:03,301 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 319 flow [2022-12-13 00:46:03,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:03,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:03,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 319 flow [2022-12-13 00:46:03,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 319 flow [2022-12-13 00:46:03,329 INFO L130 PetriNetUnfolder]: 203/450 cut-off events. [2022-12-13 00:46:03,330 INFO L131 PetriNetUnfolder]: For 668/683 co-relation queries the response was YES. [2022-12-13 00:46:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 450 events. 203/450 cut-off events. For 668/683 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2658 event pairs, 0 based on Foata normal form. 4/188 useless extension candidates. Maximal degree in co-relation 1316. Up to 208 conditions per place. [2022-12-13 00:46:03,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 319 flow [2022-12-13 00:46:03,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 00:46:04,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L754-->P0FINAL: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd1~0_143 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_211 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_616 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_617 256) 0)) .cse5)) (.cse3 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_543 256) 0))))) (and (= v_~z$r_buff0_thd1~0_210 (ite .cse0 0 v_~z$r_buff0_thd1~0_211)) (= |v_P0Thread1of1ForFork2_#res#1.offset_51| 0) (= v_~__unbuffered_cnt~0_461 (+ v_~__unbuffered_cnt~0_462 1)) (= v_~z$r_buff1_thd1~0_142 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_210 256) 0)) .cse1) (and .cse2 (not (= 0 (mod v_~z$w_buff1_used~0_542 256))))) 0 v_~z$r_buff1_thd1~0_143)) (= v_~z$w_buff1_used~0_542 (ite (or .cse0 .cse3) 0 v_~z$w_buff1_used~0_543)) (= |v_P0Thread1of1ForFork2_#res#1.base_51| 0) (= v_~z$w_buff0_used~0_616 (ite .cse4 0 v_~z$w_buff0_used~0_617)) (= v_~z~0_467 (ite .cse4 v_~z$w_buff0~0_383 (ite .cse3 v_~z$w_buff1~0_349 v_~z~0_468)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_617, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_143, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_543, ~z$w_buff1~0=v_~z$w_buff1~0_349, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_462, ~z~0=v_~z~0_468, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_211} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_51|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_616, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_142, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_51|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_542, ~z$w_buff1~0=v_~z$w_buff1~0_349, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_461, ~z~0=v_~z~0_467, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [481] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113| 0) (= v_~z~0_417 (ite .cse0 v_~z$w_buff0~0_345 (ite .cse1 v_~z$w_buff1~0_318 v_~z~0_418))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_459 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~z$r_buff1_thd0~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_158 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd0~0_163)) (= v_~z$w_buff0_used~0_558 (ite .cse0 0 v_~z$w_buff0_used~0_559)) (= v_~z$r_buff0_thd0~0_158 (ite .cse4 0 v_~z$r_buff0_thd0~0_159)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| (mod v_~main$tmp_guard1~0_140 256)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492)) (= (ite (= (ite (not (and (= v_~y~0_133 2) (= v_~__unbuffered_p2_EAX~0_167 0) (= 2 v_~x~0_135))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_140) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_345, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_418, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_345, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_417, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:46:04,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L754-->L764: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_171 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_644 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_239 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_645 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_571 256) 0)) .cse4))) (and (= v_~z$w_buff0_used~0_644 (ite .cse0 0 v_~z$w_buff0_used~0_645)) (= v_~__unbuffered_cnt~0_489 (+ v_~__unbuffered_cnt~0_490 1)) (= v_~z~0_495 (ite .cse0 v_~z$w_buff0~0_397 (ite .cse1 v_~z$w_buff1~0_363 v_~z~0_496))) (= v_~z$r_buff0_thd1~0_238 (ite .cse2 0 v_~z$r_buff0_thd1~0_239)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_571) v_~z$w_buff1_used~0_570) (= v_~z$r_buff1_thd1~0_170 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_238 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_570 256) 0)))) 0 v_~z$r_buff1_thd1~0_171))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_645, ~z$w_buff0~0=v_~z$w_buff0~0_397, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_171, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_571, ~z$w_buff1~0=v_~z$w_buff1~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_490, ~z~0=v_~z~0_496, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_239} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_397, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_170, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_570, ~z$w_buff1~0=v_~z$w_buff1~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_489, ~z~0=v_~z~0_495, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_238} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [481] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113| 0) (= v_~z~0_417 (ite .cse0 v_~z$w_buff0~0_345 (ite .cse1 v_~z$w_buff1~0_318 v_~z~0_418))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_459 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~z$r_buff1_thd0~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_158 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd0~0_163)) (= v_~z$w_buff0_used~0_558 (ite .cse0 0 v_~z$w_buff0_used~0_559)) (= v_~z$r_buff0_thd0~0_158 (ite .cse4 0 v_~z$r_buff0_thd0~0_159)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| (mod v_~main$tmp_guard1~0_140 256)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492)) (= (ite (= (ite (not (and (= v_~y~0_133 2) (= v_~__unbuffered_p2_EAX~0_167 0) (= 2 v_~x~0_135))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_140) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_345, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_418, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_345, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_417, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:46:05,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L754-->P0EXIT: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_175 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_243 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_648 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_575 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_649 256) 0))))) (and (= v_~__unbuffered_cnt~0_493 (+ v_~__unbuffered_cnt~0_494 1)) (= |v_P0Thread1of1ForFork2_#res#1.offset_61| 0) (= v_~z$r_buff1_thd1~0_174 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_574 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_242 256) 0)))) 0 v_~z$r_buff1_thd1~0_175)) (= |v_P0Thread1of1ForFork2_#res#1.base_61| 0) (= v_~z$w_buff1_used~0_574 (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_575)) (= v_~z$r_buff0_thd1~0_242 (ite .cse3 0 v_~z$r_buff0_thd1~0_243)) (= v_~z~0_499 (ite .cse4 v_~z$w_buff0~0_399 (ite .cse2 v_~z$w_buff1~0_365 v_~z~0_500))) (= v_~z$w_buff0_used~0_648 (ite .cse4 0 v_~z$w_buff0_used~0_649))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_649, ~z$w_buff0~0=v_~z$w_buff0~0_399, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_575, ~z$w_buff1~0=v_~z$w_buff1~0_365, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_494, ~z~0=v_~z~0_500, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_243} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_61|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_648, ~z$w_buff0~0=v_~z$w_buff0~0_399, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_174, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_61|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_574, ~z$w_buff1~0=v_~z$w_buff1~0_365, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_493, ~z~0=v_~z~0_499, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_242} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [481] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113| 0) (= v_~z~0_417 (ite .cse0 v_~z$w_buff0~0_345 (ite .cse1 v_~z$w_buff1~0_318 v_~z~0_418))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_459 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= v_~z$r_buff1_thd0~0_162 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_158 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd0~0_163)) (= v_~z$w_buff0_used~0_558 (ite .cse0 0 v_~z$w_buff0_used~0_559)) (= v_~z$r_buff0_thd0~0_158 (ite .cse4 0 v_~z$r_buff0_thd0~0_159)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| (mod v_~main$tmp_guard1~0_140 256)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492)) (= (ite (= (ite (not (and (= v_~y~0_133 2) (= v_~__unbuffered_p2_EAX~0_167 0) (= 2 v_~x~0_135))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_140) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_345, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_418, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_113|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_345, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_318, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_158, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_109|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~z~0=v_~z~0_417, ~y~0=v_~y~0_133, ~x~0=v_~x~0_135, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:46:05,491 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:46:05,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2191 [2022-12-13 00:46:05,492 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 347 flow [2022-12-13 00:46:05,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 00:46:05,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:05,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:05,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:46:05,493 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 00:46:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 678351416, now seen corresponding path program 1 times [2022-12-13 00:46:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:05,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776724964] [2022-12-13 00:46:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:05,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:46:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:05,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:46:05,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:46:05,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:46:05,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:46:05,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:46:05,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:46:05,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:46:05,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:46:05,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:46:05,607 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:05,612 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:46:05,612 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:46:05,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:05 BasicIcfg [2022-12-13 00:46:05,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:46:05,667 INFO L158 Benchmark]: Toolchain (without parser) took 18874.60ms. Allocated memory was 227.5MB in the beginning and 961.5MB in the end (delta: 734.0MB). Free memory was 193.8MB in the beginning and 829.5MB in the end (delta: -635.7MB). Peak memory consumption was 99.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:05,667 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 227.5MB. Free memory is still 205.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:46:05,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.60ms. Allocated memory is still 227.5MB. Free memory was 193.8MB in the beginning and 167.3MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:46:05,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.09ms. Allocated memory is still 227.5MB. Free memory was 167.3MB in the beginning and 165.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:05,668 INFO L158 Benchmark]: Boogie Preprocessor took 25.44ms. Allocated memory is still 227.5MB. Free memory was 165.2MB in the beginning and 163.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:05,668 INFO L158 Benchmark]: RCFGBuilder took 707.64ms. Allocated memory is still 227.5MB. Free memory was 163.1MB in the beginning and 128.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 00:46:05,668 INFO L158 Benchmark]: TraceAbstraction took 17522.89ms. Allocated memory was 227.5MB in the beginning and 961.5MB in the end (delta: 734.0MB). Free memory was 203.5MB in the beginning and 829.5MB in the end (delta: -626.0MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2022-12-13 00:46:05,669 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.09ms. Allocated memory is still 227.5MB. Free memory is still 205.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 548.60ms. Allocated memory is still 227.5MB. Free memory was 193.8MB in the beginning and 167.3MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.09ms. Allocated memory is still 227.5MB. Free memory was 167.3MB in the beginning and 165.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.44ms. Allocated memory is still 227.5MB. Free memory was 165.2MB in the beginning and 163.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 707.64ms. Allocated memory is still 227.5MB. Free memory was 163.1MB in the beginning and 128.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17522.89ms. Allocated memory was 227.5MB in the beginning and 961.5MB in the end (delta: 734.0MB). Free memory was 203.5MB in the beginning and 829.5MB in the end (delta: -626.0MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 112 PlacesBefore, 75 PlacesAfterwards, 104 TransitionsBefore, 65 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 3275, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3523, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1646, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1646, independent: 1577, independent conditional: 0, independent unconditional: 1577, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3523, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 1646, unknown conditional: 0, unknown unconditional: 1646] , Statistics on independence cache: Total cache size (in pairs): 3316, Positive cache size: 3262, Positive conditional cache size: 0, Positive unconditional cache size: 3262, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, 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, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 249, independent conditional: 249, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 249, independent conditional: 25, independent unconditional: 224, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 249, independent conditional: 25, independent unconditional: 224, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 249, independent conditional: 25, independent unconditional: 224, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 228, independent: 203, independent conditional: 23, independent unconditional: 180, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 228, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 86, dependent conditional: 45, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, independent: 46, independent conditional: 2, independent unconditional: 44, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 228, unknown conditional: 31, unknown unconditional: 197] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 203, Positive conditional cache size: 23, Positive unconditional cache size: 180, Negative cache size: 25, Negative conditional cache size: 8, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 27, independent unconditional: 233, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 260, independent conditional: 0, independent unconditional: 260, 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: 286, independent: 260, independent conditional: 0, independent unconditional: 260, 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: 46, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 243, Positive conditional cache size: 23, Positive unconditional cache size: 220, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 298, independent: 269, independent conditional: 269, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 298, independent: 269, independent conditional: 35, independent unconditional: 234, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 298, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 298, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 298, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 260, Positive conditional cache size: 23, Positive unconditional cache size: 237, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 339, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 68, independent unconditional: 271, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 373, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 37, independent unconditional: 144, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 32, dependent conditional: 0, dependent unconditional: 32, 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: 213, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1016 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 197, independent: 164, independent conditional: 33, independent unconditional: 131, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 197, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 262, Positive conditional cache size: 23, Positive unconditional cache size: 239, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, 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.5s, 66 PlacesBefore, 64 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 224, independent conditional: 224, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 292, independent: 224, independent conditional: 60, independent unconditional: 164, dependent: 68, dependent conditional: 22, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, independent: 224, independent conditional: 12, independent unconditional: 212, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, independent: 224, independent conditional: 12, independent unconditional: 212, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, independent: 224, independent conditional: 12, independent unconditional: 212, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 263, Positive conditional cache size: 23, Positive unconditional cache size: 240, Negative cache size: 42, Negative conditional cache size: 8, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 56 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 49 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 468, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 468, independent: 414, independent conditional: 339, independent unconditional: 75, dependent: 54, dependent conditional: 32, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 468, independent: 414, independent conditional: 339, independent unconditional: 75, dependent: 54, dependent conditional: 32, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 468, independent: 414, independent conditional: 339, independent unconditional: 75, dependent: 54, dependent conditional: 32, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 42, independent conditional: 35, independent unconditional: 7, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 124, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 468, independent: 372, independent conditional: 304, independent unconditional: 68, dependent: 52, dependent conditional: 30, dependent unconditional: 22, unknown: 44, unknown conditional: 37, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 476, Positive conditional cache size: 58, Positive unconditional cache size: 418, Negative cache size: 44, Negative conditional cache size: 10, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-1, t1489={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] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=0, t1489={5:0}, t1490={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] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=1, t1489={5:0}, t1490={6:0}, t1491={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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __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=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __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=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 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) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 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_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=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=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=2, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 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) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 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 [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 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_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=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 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) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 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 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 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 [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, 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: 834]: 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: 836]: 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: 832]: 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, 134 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: 17.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 712 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 11 mSDtfsCounter, 712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=7, InterpolantAutomatonStates: 36, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 00:46:05,694 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...