/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:26:18,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:26:18,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:26:18,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:26:18,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:26:18,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:26:18,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:26:18,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:26:18,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:26:18,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:26:18,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:26:18,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:26:18,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:26:18,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:26:18,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:26:18,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:26:18,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:26:18,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:26:18,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:26:18,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:26:18,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:26:18,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:26:18,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:26:18,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:26:18,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:26:18,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:26:18,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:26:18,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:26:18,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:26:18,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:26:18,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:26:18,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:26:18,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:26:18,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:26:18,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:26:18,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:26:18,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:26:18,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:26:18,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:26:18,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:26:18,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:26:18,104 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:26:18,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:26:18,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:26:18,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:26:18,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:26:18,133 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:26:18,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:26:18,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:26:18,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:26:18,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:26:18,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:26:18,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:26:18,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:26:18,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:26:18,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:26:18,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:26:18,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:26:18,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:26:18,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:26:18,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:26:18,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:26:18,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:26:18,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:26:18,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:26:18,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:26:18,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:26:18,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:26:18,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:26:18,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:26:18,137 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-06 04:26:18,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:26:18,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:26:18,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:26:18,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:26:18,529 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:26:18,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:26:19,806 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:26:20,043 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:26:20,044 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:26:20,061 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8330192f/aa9d9448d20841489b9d8a482e7658ce/FLAGd5832f994 [2022-12-06 04:26:20,074 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8330192f/aa9d9448d20841489b9d8a482e7658ce [2022-12-06 04:26:20,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:26:20,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:26:20,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:26:20,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:26:20,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:26:20,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79454470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20, skipping insertion in model container [2022-12-06 04:26:20,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:26:20,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:26:20,268 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-06 04:26:20,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:26:20,458 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:26:20,472 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-06 04:26:20,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:20,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:20,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:26:20,577 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:26:20,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20 WrapperNode [2022-12-06 04:26:20,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:26:20,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:26:20,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:26:20,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:26:20,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,649 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 04:26:20,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:26:20,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:26:20,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:26:20,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:26:20,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,688 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:26:20,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:26:20,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:26:20,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:26:20,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (1/1) ... [2022-12-06 04:26:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:26:20,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:26:20,727 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-06 04:26:20,734 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-06 04:26:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:26:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:26:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:26:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:26:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:26:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:26:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:26:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:26:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:26:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:26:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:26:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:26:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:26:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:26:20,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:26:20,780 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:26:20,978 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:26:20,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:26:21,258 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:26:21,406 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:26:21,406 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:26:21,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:26:21 BoogieIcfgContainer [2022-12-06 04:26:21,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:26:21,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:26:21,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:26:21,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:26:21,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:26:20" (1/3) ... [2022-12-06 04:26:21,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2211e36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:26:21, skipping insertion in model container [2022-12-06 04:26:21,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:20" (2/3) ... [2022-12-06 04:26:21,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2211e36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:26:21, skipping insertion in model container [2022-12-06 04:26:21,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:26:21" (3/3) ... [2022-12-06 04:26:21,417 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:26:21,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:26:21,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:26:21,434 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:26:21,490 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:26:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:26:21,570 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:26:21,570 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:21,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:26:21,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 04:26:21,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 04:26:21,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:21,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:26:21,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 04:26:21,687 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 04:26:21,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:21,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:26:21,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 04:26:21,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 04:26:27,581 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 04:26:27,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:26:27,608 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;@33bcbbef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:26:27,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:26:27,611 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 04:26:27,611 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:27,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:27,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:26:27,612 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-06 04:26:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 466763, now seen corresponding path program 1 times [2022-12-06 04:26:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169976659] [2022-12-06 04:26:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:27,943 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-06 04:26:27,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169976659] [2022-12-06 04:26:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169976659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:27,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:26:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859102796] [2022-12-06 04:26:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:27,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:26:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:26:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:26:27,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:26:27,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:26:27,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:27,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:26:27,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:28,257 INFO L130 PetriNetUnfolder]: 882/1364 cut-off events. [2022-12-06 04:26:28,258 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:26:28,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 1364 events. 882/1364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6249 event pairs, 366 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 2727. Up to 1078 conditions per place. [2022-12-06 04:26:28,268 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 29 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-06 04:26:28,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 177 flow [2022-12-06 04:26:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:26:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:26:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:26:28,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-06 04:26:28,280 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:26:28,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 177 flow [2022-12-06 04:26:28,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:26:28,285 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 04:26:28,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 04:26:28,289 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:26:28,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:28,290 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 04:26:28,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:28,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:28,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 04:26:28,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:26:28,298 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:26:28,299 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:26:28,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:26:28,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:26:28,395 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:28,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 04:26:28,397 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:26:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:26:28,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:28,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:28,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:26:28,398 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-06 04:26:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1095686097, now seen corresponding path program 1 times [2022-12-06 04:26:28,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:28,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552134170] [2022-12-06 04:26:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:28,823 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-06 04:26:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:28,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552134170] [2022-12-06 04:26:28,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552134170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:28,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:28,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:26:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083741712] [2022-12-06 04:26:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:28,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:26:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:26:28,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:26:28,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:26:28,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-06 04:26:28,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:28,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:26:28,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:29,056 INFO L130 PetriNetUnfolder]: 660/1071 cut-off events. [2022-12-06 04:26:29,057 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 04:26:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1071 events. 660/1071 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5110 event pairs, 126 based on Foata normal form. 20/1090 useless extension candidates. Maximal degree in co-relation 2193. Up to 839 conditions per place. [2022-12-06 04:26:29,065 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 04:26:29,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 138 flow [2022-12-06 04:26:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:26:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:26:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:26:29,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 04:26:29,066 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:26:29,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 138 flow [2022-12-06 04:26:29,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:26:29,068 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 04:26:29,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:26:29,069 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 04:26:29,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:29,069 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:26:29,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:29,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:29,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:26:29,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:26:29,075 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:26:29,075 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:26:29,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:26:29,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 04:26:29,086 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:29,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:26:29,088 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 04:26:29,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-06 04:26:29,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:29,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:29,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:26:29,089 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-06 04:26:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash -393468605, now seen corresponding path program 1 times [2022-12-06 04:26:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:29,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619270800] [2022-12-06 04:26:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:29,298 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-06 04:26:29,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:29,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619270800] [2022-12-06 04:26:29,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619270800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:29,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:29,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:26:29,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25430307] [2022-12-06 04:26:29,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:29,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:26:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:26:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:26:29,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:26:29,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 04:26:29,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:29,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:26:29,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:29,548 INFO L130 PetriNetUnfolder]: 831/1334 cut-off events. [2022-12-06 04:26:29,548 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-12-06 04:26:29,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 1334 events. 831/1334 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6828 event pairs, 207 based on Foata normal form. 60/1384 useless extension candidates. Maximal degree in co-relation 2858. Up to 493 conditions per place. [2022-12-06 04:26:29,555 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 34 selfloop transitions, 3 changer transitions 5/44 dead transitions. [2022-12-06 04:26:29,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 195 flow [2022-12-06 04:26:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:26:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:26:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 04:26:29,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 04:26:29,558 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 52 transitions. [2022-12-06 04:26:29,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 195 flow [2022-12-06 04:26:29,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:26:29,560 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 66 flow [2022-12-06 04:26:29,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 04:26:29,561 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:26:29,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:29,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 66 flow [2022-12-06 04:26:29,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:29,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:29,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 66 flow [2022-12-06 04:26:29,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 66 flow [2022-12-06 04:26:29,568 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:26:29,568 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 04:26:29,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 21 events. 0/21 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:26:29,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 66 flow [2022-12-06 04:26:29,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 04:26:29,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:26:29,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 04:26:29,724 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 64 flow [2022-12-06 04:26:29,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 04:26:29,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:29,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:29,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:26:29,725 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-06 04:26:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -300067773, now seen corresponding path program 1 times [2022-12-06 04:26:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:29,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386581115] [2022-12-06 04:26:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:29,985 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-06 04:26:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386581115] [2022-12-06 04:26:29,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386581115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:29,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:26:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609510350] [2022-12-06 04:26:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:26:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:26:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:26:29,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:26:29,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:26:29,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:29,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:26:29,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:30,130 INFO L130 PetriNetUnfolder]: 479/751 cut-off events. [2022-12-06 04:26:30,130 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 04:26:30,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 751 events. 479/751 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2949 event pairs, 111 based on Foata normal form. 9/757 useless extension candidates. Maximal degree in co-relation 1825. Up to 588 conditions per place. [2022-12-06 04:26:30,136 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:26:30,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 142 flow [2022-12-06 04:26:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:26:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:26:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:26:30,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 04:26:30,138 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 64 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:26:30,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 142 flow [2022-12-06 04:26:30,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 125 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:26:30,141 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 60 flow [2022-12-06 04:26:30,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 04:26:30,142 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2022-12-06 04:26:30,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:30,142 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 60 flow [2022-12-06 04:26:30,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:30,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:30,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 60 flow [2022-12-06 04:26:30,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 20 transitions, 60 flow [2022-12-06 04:26:30,146 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:26:30,146 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:26:30,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:26:30,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 20 transitions, 60 flow [2022-12-06 04:26:30,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 04:26:30,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:30,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:26:30,196 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 60 flow [2022-12-06 04:26:30,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:26:30,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:30,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:30,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:26:30,196 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-06 04:26:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1432929853, now seen corresponding path program 1 times [2022-12-06 04:26:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:30,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909823160] [2022-12-06 04:26:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:30,472 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-06 04:26:30,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:30,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909823160] [2022-12-06 04:26:30,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909823160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:30,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:30,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:26:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767447391] [2022-12-06 04:26:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:30,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:26:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:26:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:26:30,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:26:30,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 60 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:26:30,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:30,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:26:30,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:30,739 INFO L130 PetriNetUnfolder]: 742/1127 cut-off events. [2022-12-06 04:26:30,740 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-06 04:26:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1127 events. 742/1127 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4607 event pairs, 119 based on Foata normal form. 12/1139 useless extension candidates. Maximal degree in co-relation 2572. Up to 634 conditions per place. [2022-12-06 04:26:30,746 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2022-12-06 04:26:30,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 247 flow [2022-12-06 04:26:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:26:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:26:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 04:26:30,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 04:26:30,748 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 60 flow. Second operand 5 states and 54 transitions. [2022-12-06 04:26:30,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 247 flow [2022-12-06 04:26:30,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:26:30,755 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 152 flow [2022-12-06 04:26:30,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-06 04:26:30,757 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 04:26:30,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:30,757 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 152 flow [2022-12-06 04:26:30,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:30,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:30,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 152 flow [2022-12-06 04:26:30,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 152 flow [2022-12-06 04:26:30,785 INFO L130 PetriNetUnfolder]: 100/227 cut-off events. [2022-12-06 04:26:30,786 INFO L131 PetriNetUnfolder]: For 129/143 co-relation queries the response was YES. [2022-12-06 04:26:30,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 227 events. 100/227 cut-off events. For 129/143 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1102 event pairs, 40 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 600. Up to 126 conditions per place. [2022-12-06 04:26:30,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 152 flow [2022-12-06 04:26:30,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 04:26:30,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [327] L756-->L763: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_137 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_123 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_138 256) 0))))) (and (= v_~z~0_93 (ite .cse0 v_~z$w_buff0~0_67 (ite .cse1 v_~z$w_buff1~0_60 v_~z~0_94))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_123) v_~z$w_buff1_used~0_122) (= v_~z$r_buff0_thd1~0_30 (ite .cse2 0 v_~z$r_buff0_thd1~0_31)) (= v_~z$w_buff0_used~0_137 (ite .cse0 0 v_~z$w_buff0_used~0_138)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_122 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_26) v_~z$r_buff1_thd1~0_25)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_138, ~z$w_buff0~0=v_~z$w_buff0~0_67, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_123, ~z$w_buff1~0=v_~z$w_buff1~0_60, ~z~0=v_~z~0_94, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_137, ~z$w_buff0~0=v_~z$w_buff0~0_67, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_122, ~z$w_buff1~0=v_~z$w_buff1~0_60, ~z~0=v_~z~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-06 04:26:31,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [421] L829-->L836: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd0~0_140 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_249 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_140 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_222 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_250 256) 0)) .cse5))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= (ite .cse0 v_~z$w_buff0~0_163 (ite .cse1 v_~z$w_buff1~0_135 v_~z~0_186)) v_~z~0_185) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~z$w_buff1_used~0_221 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_222)) (= v_~z$r_buff1_thd0~0_139 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_221 256) 0))) (and (not (= 0 (mod v_~z$r_buff0_thd0~0_139 256))) .cse4)) 0 v_~z$r_buff1_thd0~0_140)) (= v_~z$r_buff0_thd0~0_139 (ite .cse2 0 v_~z$r_buff0_thd0~0_140)) (= v_~z$w_buff0_used~0_249 (ite .cse0 0 v_~z$w_buff0_used~0_250))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_140, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_250, ~z$w_buff0~0=v_~z$w_buff0~0_163, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_140, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_222, ~z$w_buff1~0=v_~z$w_buff1~0_135, ~z~0=v_~z~0_186, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_249, ~z$w_buff0~0=v_~z$w_buff0~0_163, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_139, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_221, ~z$w_buff1~0=v_~z$w_buff1~0_135, ~z~0=v_~z~0_185, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0] [2022-12-06 04:26:31,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [341] L796-->L803: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_113 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= 0 (mod v_~z$w_buff0_used~0_114 256))) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_101 256) 0))))) (and (= v_~z$w_buff0_used~0_113 (ite .cse0 0 v_~z$w_buff0_used~0_114)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_101)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse4)) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17) (= v_~z$r_buff0_thd3~0_21 (ite .cse1 0 v_~z$r_buff0_thd3~0_22)) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_49 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-06 04:26:31,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:26:31,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 478 [2022-12-06 04:26:31,235 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 160 flow [2022-12-06 04:26:31,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:26:31,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:31,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:31,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:26:31,236 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-06 04:26:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1289393393, now seen corresponding path program 2 times [2022-12-06 04:26:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:31,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350963407] [2022-12-06 04:26:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:31,480 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-06 04:26:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:31,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350963407] [2022-12-06 04:26:31,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350963407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:31,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:31,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:26:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749069809] [2022-12-06 04:26:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:31,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:26:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:26:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:26:31,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:26:31,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 160 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 04:26:31,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:31,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:26:31,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:31,719 INFO L130 PetriNetUnfolder]: 881/1344 cut-off events. [2022-12-06 04:26:31,719 INFO L131 PetriNetUnfolder]: For 1629/1629 co-relation queries the response was YES. [2022-12-06 04:26:31,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4303 conditions, 1344 events. 881/1344 cut-off events. For 1629/1629 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5451 event pairs, 231 based on Foata normal form. 48/1392 useless extension candidates. Maximal degree in co-relation 4288. Up to 544 conditions per place. [2022-12-06 04:26:31,727 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 31 selfloop transitions, 3 changer transitions 15/49 dead transitions. [2022-12-06 04:26:31,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 327 flow [2022-12-06 04:26:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:26:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:26:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 04:26:31,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 04:26:31,731 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 160 flow. Second operand 4 states and 45 transitions. [2022-12-06 04:26:31,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 327 flow [2022-12-06 04:26:31,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 313 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:26:31,737 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 111 flow [2022-12-06 04:26:31,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-06 04:26:31,740 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 04:26:31,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:31,740 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 111 flow [2022-12-06 04:26:31,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:31,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:31,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 111 flow [2022-12-06 04:26:31,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 22 transitions, 111 flow [2022-12-06 04:26:31,755 INFO L130 PetriNetUnfolder]: 34/96 cut-off events. [2022-12-06 04:26:31,756 INFO L131 PetriNetUnfolder]: For 139/156 co-relation queries the response was YES. [2022-12-06 04:26:31,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 96 events. 34/96 cut-off events. For 139/156 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 33 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 266. Up to 57 conditions per place. [2022-12-06 04:26:31,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 22 transitions, 111 flow [2022-12-06 04:26:31,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 04:26:31,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] $Ultimate##0-->L756: Formula: (and (= v_~z$r_buff0_thd2~0_117 v_~z$r_buff1_thd2~0_116) (= v_~z$r_buff0_thd1~0_139 v_~z$r_buff1_thd1~0_109) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_41| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_41|) (= v_~z$w_buff0_used~0_539 1) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_539 256) 0)) (not (= (mod v_~z$w_buff1_used~0_493 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_41|) (= v_~z$r_buff0_thd3~0_147 v_~z$r_buff1_thd3~0_140) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_39| |v_P0Thread1of1ForFork2_~arg#1.offset_39|) (= v_~z$r_buff0_thd1~0_138 1) (= v_~z$r_buff0_thd0~0_311 v_~z$r_buff1_thd0~0_316) (= v_~z$w_buff0_used~0_540 v_~z$w_buff1_used~0_493) (= v_~z$w_buff0~0_358 2) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_41| 0)) (= v_~z$w_buff0~0_359 v_~z$w_buff1~0_314) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_39| |v_P0Thread1of1ForFork2_~arg#1.base_39|) (= v_~x~0_44 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_311, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_540, ~z$w_buff0~0=v_~z$w_buff0~0_359, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_39|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_39|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_139, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_117} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_539, ~z$w_buff0~0=v_~z$w_buff0~0_358, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_140, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_116, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_41|, ~z$w_buff1~0=v_~z$w_buff1~0_314, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_39|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_39|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_311, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_41|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_316, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_109, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_138, ~x~0=v_~x~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_117} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] and [426] $Ultimate##0-->L773: Formula: (and (= v_~x~0_18 v_~__unbuffered_p1_EAX~0_50) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_18} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base] [2022-12-06 04:26:31,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L829-->L836: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd0~0_140 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_249 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_140 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_222 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_250 256) 0)) .cse5))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= (ite .cse0 v_~z$w_buff0~0_163 (ite .cse1 v_~z$w_buff1~0_135 v_~z~0_186)) v_~z~0_185) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~z$w_buff1_used~0_221 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_222)) (= v_~z$r_buff1_thd0~0_139 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_221 256) 0))) (and (not (= 0 (mod v_~z$r_buff0_thd0~0_139 256))) .cse4)) 0 v_~z$r_buff1_thd0~0_140)) (= v_~z$r_buff0_thd0~0_139 (ite .cse2 0 v_~z$r_buff0_thd0~0_140)) (= v_~z$w_buff0_used~0_249 (ite .cse0 0 v_~z$w_buff0_used~0_250))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_140, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_250, ~z$w_buff0~0=v_~z$w_buff0~0_163, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_140, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_222, ~z$w_buff1~0=v_~z$w_buff1~0_135, ~z~0=v_~z~0_186, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_249, ~z$w_buff0~0=v_~z$w_buff0~0_163, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_139, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_221, ~z$w_buff1~0=v_~z$w_buff1~0_135, ~z~0=v_~z~0_185, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0] and [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:26:31,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] L829-->L776: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_636 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_342 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_347 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_585 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_637 256) 0))))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| 0)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_585) v_~z$w_buff1_used~0_584) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= v_~z~0_550 (ite .cse2 v_~z$w_buff0~0_412 (ite .cse0 v_~z$w_buff1~0_362 v_~z~0_551))) (= v_~z$r_buff0_thd0~0_341 (ite .cse1 0 v_~z$r_buff0_thd0~0_342)) (= v_~z$r_buff1_thd0~0_346 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_341 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_584 256) 0)))) 0 v_~z$r_buff1_thd0~0_347)) (= (ite .cse2 0 v_~z$w_buff0_used~0_637) v_~z$w_buff0_used~0_636) (= v_~y~0_70 1)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_342, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_637, ~z$w_buff0~0=v_~z$w_buff0~0_412, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_585, ~z$w_buff1~0=v_~z$w_buff1~0_362, ~z~0=v_~z~0_551, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_341, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_636, ~z$w_buff0~0=v_~z$w_buff0~0_412, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_346, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_584, ~z$w_buff1~0=v_~z$w_buff1~0_362, ~z~0=v_~z~0_550, ~y~0=v_~y~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0, ~y~0] and [404] $Ultimate##0-->L793: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_10 v_~__unbuffered_p2_EAX~0_26)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_10} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_10} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-06 04:26:32,146 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:26:32,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-06 04:26:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 123 flow [2022-12-06 04:26:32,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 04:26:32,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:32,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:26:32,148 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-06 04:26:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1471084326, now seen corresponding path program 1 times [2022-12-06 04:26:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:32,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633041218] [2022-12-06 04:26:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:32,754 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-06 04:26:32,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633041218] [2022-12-06 04:26:32,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633041218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:32,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:32,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:26:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58526840] [2022-12-06 04:26:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:32,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:26:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:26:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:26:32,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:26:32,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-06 04:26:32,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:32,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:26:32,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:32,888 INFO L130 PetriNetUnfolder]: 368/585 cut-off events. [2022-12-06 04:26:32,888 INFO L131 PetriNetUnfolder]: For 1016/1023 co-relation queries the response was YES. [2022-12-06 04:26:32,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 585 events. 368/585 cut-off events. For 1016/1023 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2123 event pairs, 132 based on Foata normal form. 3/587 useless extension candidates. Maximal degree in co-relation 1927. Up to 546 conditions per place. [2022-12-06 04:26:32,893 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2022-12-06 04:26:32,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 214 flow [2022-12-06 04:26:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:26:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:26:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:26:32,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 04:26:32,895 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 123 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:26:32,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 214 flow [2022-12-06 04:26:32,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 185 flow, removed 5 selfloop flow, removed 8 redundant places. [2022-12-06 04:26:32,898 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 112 flow [2022-12-06 04:26:32,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-06 04:26:32,899 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2022-12-06 04:26:32,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:32,899 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 112 flow [2022-12-06 04:26:32,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:32,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:32,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 112 flow [2022-12-06 04:26:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 112 flow [2022-12-06 04:26:32,912 INFO L130 PetriNetUnfolder]: 30/89 cut-off events. [2022-12-06 04:26:32,912 INFO L131 PetriNetUnfolder]: For 85/118 co-relation queries the response was YES. [2022-12-06 04:26:32,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 89 events. 30/89 cut-off events. For 85/118 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 319 event pairs, 18 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 253. Up to 53 conditions per place. [2022-12-06 04:26:32,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 112 flow [2022-12-06 04:26:32,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 04:26:32,914 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:32,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:26:32,915 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 112 flow [2022-12-06 04:26:32,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-06 04:26:32,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:32,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:26:32,916 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-06 04:26:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1720166813, now seen corresponding path program 1 times [2022-12-06 04:26:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:32,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272862294] [2022-12-06 04:26:32,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:33,113 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-06 04:26:33,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272862294] [2022-12-06 04:26:33,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272862294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:33,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:33,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:26:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258274766] [2022-12-06 04:26:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:33,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:26:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:26:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:26:33,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:26:33,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-06 04:26:33,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:33,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:26:33,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:33,243 INFO L130 PetriNetUnfolder]: 250/442 cut-off events. [2022-12-06 04:26:33,244 INFO L131 PetriNetUnfolder]: For 766/769 co-relation queries the response was YES. [2022-12-06 04:26:33,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 442 events. 250/442 cut-off events. For 766/769 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1758 event pairs, 51 based on Foata normal form. 40/479 useless extension candidates. Maximal degree in co-relation 1462. Up to 273 conditions per place. [2022-12-06 04:26:33,247 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 4 changer transitions 21/56 dead transitions. [2022-12-06 04:26:33,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 374 flow [2022-12-06 04:26:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:26:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:26:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 04:26:33,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:26:33,248 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 112 flow. Second operand 5 states and 60 transitions. [2022-12-06 04:26:33,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 374 flow [2022-12-06 04:26:33,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 355 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 04:26:33,250 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 138 flow [2022-12-06 04:26:33,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2022-12-06 04:26:33,251 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 04:26:33,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:33,251 INFO L89 Accepts]: Start accepts. Operand has 41 places, 26 transitions, 138 flow [2022-12-06 04:26:33,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:33,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:33,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 138 flow [2022-12-06 04:26:33,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 138 flow [2022-12-06 04:26:33,271 INFO L130 PetriNetUnfolder]: 67/149 cut-off events. [2022-12-06 04:26:33,271 INFO L131 PetriNetUnfolder]: For 200/209 co-relation queries the response was YES. [2022-12-06 04:26:33,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 149 events. 67/149 cut-off events. For 200/209 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 575 event pairs, 35 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 507. Up to 71 conditions per place. [2022-12-06 04:26:33,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 138 flow [2022-12-06 04:26:33,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:26:33,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:26:33,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 04:26:33,297 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 136 flow [2022-12-06 04:26:33,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-06 04:26:33,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:33,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:33,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:26:33,298 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-06 04:26:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1919934212, now seen corresponding path program 1 times [2022-12-06 04:26:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:33,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732334182] [2022-12-06 04:26:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:33,441 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-06 04:26:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:33,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732334182] [2022-12-06 04:26:33,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732334182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:33,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:33,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:26:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100238276] [2022-12-06 04:26:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:33,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:26:33,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:33,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:26:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:26:33,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:26:33,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 04:26:33,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:33,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:26:33,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:33,573 INFO L130 PetriNetUnfolder]: 136/263 cut-off events. [2022-12-06 04:26:33,573 INFO L131 PetriNetUnfolder]: For 586/586 co-relation queries the response was YES. [2022-12-06 04:26:33,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 263 events. 136/263 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 899 event pairs, 26 based on Foata normal form. 25/287 useless extension candidates. Maximal degree in co-relation 1022. Up to 102 conditions per place. [2022-12-06 04:26:33,576 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 35 selfloop transitions, 7 changer transitions 16/59 dead transitions. [2022-12-06 04:26:33,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 444 flow [2022-12-06 04:26:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:26:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:26:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 04:26:33,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 04:26:33,577 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 136 flow. Second operand 6 states and 63 transitions. [2022-12-06 04:26:33,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 444 flow [2022-12-06 04:26:33,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 438 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:26:33,580 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 186 flow [2022-12-06 04:26:33,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 04:26:33,581 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 04:26:33,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:33,581 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 186 flow [2022-12-06 04:26:33,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:33,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:33,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 186 flow [2022-12-06 04:26:33,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 186 flow [2022-12-06 04:26:33,593 INFO L130 PetriNetUnfolder]: 25/76 cut-off events. [2022-12-06 04:26:33,593 INFO L131 PetriNetUnfolder]: For 161/173 co-relation queries the response was YES. [2022-12-06 04:26:33,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 76 events. 25/76 cut-off events. For 161/173 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 217 event pairs, 8 based on Foata normal form. 5/78 useless extension candidates. Maximal degree in co-relation 295. Up to 34 conditions per place. [2022-12-06 04:26:33,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 186 flow [2022-12-06 04:26:33,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 04:26:33,601 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:33,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:26:33,602 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 186 flow [2022-12-06 04:26:33,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 04:26:33,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:33,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:33,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:26:33,603 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-06 04:26:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1306060886, now seen corresponding path program 1 times [2022-12-06 04:26:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:33,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594234143] [2022-12-06 04:26:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:33,766 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-06 04:26:33,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:33,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594234143] [2022-12-06 04:26:33,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594234143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:33,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:33,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:26:33,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960522742] [2022-12-06 04:26:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:33,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:26:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:26:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:26:33,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:26:33,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-06 04:26:33,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:33,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:26:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:33,889 INFO L130 PetriNetUnfolder]: 90/180 cut-off events. [2022-12-06 04:26:33,889 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-06 04:26:33,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 180 events. 90/180 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 538 event pairs, 23 based on Foata normal form. 8/187 useless extension candidates. Maximal degree in co-relation 729. Up to 66 conditions per place. [2022-12-06 04:26:33,891 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 32 selfloop transitions, 10 changer transitions 8/51 dead transitions. [2022-12-06 04:26:33,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 424 flow [2022-12-06 04:26:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:26:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:26:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-06 04:26:33,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 04:26:33,892 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 186 flow. Second operand 7 states and 56 transitions. [2022-12-06 04:26:33,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 424 flow [2022-12-06 04:26:33,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 375 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 04:26:33,895 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 178 flow [2022-12-06 04:26:33,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2022-12-06 04:26:33,895 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 04:26:33,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:33,896 INFO L89 Accepts]: Start accepts. Operand has 46 places, 28 transitions, 178 flow [2022-12-06 04:26:33,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:33,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:33,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 28 transitions, 178 flow [2022-12-06 04:26:33,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 178 flow [2022-12-06 04:26:33,925 INFO L130 PetriNetUnfolder]: 13/48 cut-off events. [2022-12-06 04:26:33,925 INFO L131 PetriNetUnfolder]: For 82/90 co-relation queries the response was YES. [2022-12-06 04:26:33,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 48 events. 13/48 cut-off events. For 82/90 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 2 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 154. Up to 15 conditions per place. [2022-12-06 04:26:33,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 178 flow [2022-12-06 04:26:33,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 Received shutdown request... [2022-12-06 04:40:55,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:40:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:40:55,770 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. [2022-12-06 04:40:55,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:40:55,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:40:55,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:40:55,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:40:55,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:40:55,772 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:40:55,777 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:40:55,777 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:40:55,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:40:55 BasicIcfg [2022-12-06 04:40:55,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:40:55,780 INFO L158 Benchmark]: Toolchain (without parser) took 875702.94ms. Allocated memory was 185.6MB in the beginning and 1.0GB in the end (delta: 827.3MB). Free memory was 144.0MB in the beginning and 956.4MB in the end (delta: -812.4MB). Peak memory consumption was 619.5MB. Max. memory is 8.0GB. [2022-12-06 04:40:55,780 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 139.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:40:55,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.21ms. Allocated memory is still 185.6MB. Free memory was 143.4MB in the beginning and 117.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:40:55,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.12ms. Allocated memory is still 185.6MB. Free memory was 117.2MB in the beginning and 114.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:40:55,781 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 185.6MB. Free memory was 114.6MB in the beginning and 113.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:40:55,781 INFO L158 Benchmark]: RCFGBuilder took 712.95ms. Allocated memory is still 185.6MB. Free memory was 112.5MB in the beginning and 77.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 04:40:55,782 INFO L158 Benchmark]: TraceAbstraction took 874369.53ms. Allocated memory was 185.6MB in the beginning and 1.0GB in the end (delta: 827.3MB). Free memory was 76.9MB in the beginning and 956.4MB in the end (delta: -879.5MB). Peak memory consumption was 552.4MB. Max. memory is 8.0GB. [2022-12-06 04:40:55,783 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.13ms. Allocated memory is still 185.6MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 139.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 499.21ms. Allocated memory is still 185.6MB. Free memory was 143.4MB in the beginning and 117.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.12ms. Allocated memory is still 185.6MB. Free memory was 117.2MB in the beginning and 114.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 185.6MB. Free memory was 114.6MB in the beginning and 113.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 712.95ms. Allocated memory is still 185.6MB. Free memory was 112.5MB in the beginning and 77.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 874369.53ms. Allocated memory was 185.6MB in the beginning and 1.0GB in the end (delta: 827.3MB). Free memory was 76.9MB in the beginning and 956.4MB in the end (delta: -879.5MB). Peak memory consumption was 552.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 113 PlacesBefore, 37 PlacesAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1455, independent: 1398, independent conditional: 1398, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1455, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1455, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1455, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1173, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1173, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 324, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1455, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1173, unknown conditional: 0, unknown unconditional: 1173] , Statistics on independence cache: Total cache size (in pairs): 1742, Positive cache size: 1701, Positive conditional cache size: 0, Positive unconditional cache size: 1701, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 13, independent unconditional: 51, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 64, independent conditional: 13, independent unconditional: 51, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 13, independent unconditional: 51, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 60, independent conditional: 12, independent unconditional: 48, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 90, dependent conditional: 9, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 77, unknown conditional: 14, unknown unconditional: 63] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 60, Positive conditional cache size: 12, Positive unconditional cache size: 48, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, 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.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 5, independent unconditional: 58, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 71, Positive conditional cache size: 12, Positive unconditional cache size: 59, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 136, independent conditional: 26, independent unconditional: 110, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 107, Positive conditional cache size: 12, Positive unconditional cache size: 95, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 60, independent conditional: 8, independent unconditional: 52, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 116, Positive conditional cache size: 12, Positive unconditional cache size: 104, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 37 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 30, independent unconditional: 16, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 46, independent conditional: 18, independent unconditional: 28, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 18, independent unconditional: 28, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 43, independent conditional: 18, independent unconditional: 25, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 132, Positive conditional cache size: 12, Positive unconditional cache size: 120, Negative cache size: 32, Negative conditional cache size: 5, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 40 PlacesBefore, 40 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 39, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 147, Positive conditional cache size: 12, Positive unconditional cache size: 135, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 2, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 14, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 147, Positive conditional cache size: 12, Positive unconditional cache size: 135, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 160, Positive conditional cache size: 14, Positive unconditional cache size: 146, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, 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.0s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 162, Positive conditional cache size: 16, Positive unconditional cache size: 146, Negative cache size: 36, Negative conditional cache size: 7, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 823]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 821]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 825]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 874.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 9 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, InterpolantAutomatonStates: 43, 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, 2.4s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 could not prove your program: Timeout Completed graceful shutdown