/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:52:50,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:52:50,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:52:50,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:52:50,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:52:50,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:52:50,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:52:50,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:52:50,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:52:50,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:52:50,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:52:50,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:52:50,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:52:50,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:52:50,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:52:50,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:52:50,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:52:50,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:52:50,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:52:50,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:52:50,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:52:50,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:52:50,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:52:50,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:52:50,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:52:50,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:52:50,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:52:50,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:52:50,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:52:50,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:52:50,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:52:50,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:52:50,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:52:50,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:52:50,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:52:50,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:52:50,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:52:50,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:52:50,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:52:50,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:52:50,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:52:50,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:52:50,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:52:50,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:52:50,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:52:50,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:52:50,305 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:52:50,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:52:50,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:52:50,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:52:50,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:52:50,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:52:50,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:52:50,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:52:50,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:52:50,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:52:50,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:50,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:52:50,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:52:50,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:52:50,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:52:50,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:52:50,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:52:50,308 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-05 22:52:50,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:52:50,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:52:50,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:52:50,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:52:50,573 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:52:50,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-1.i [2022-12-05 22:52:51,521 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:52:51,764 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:52:51,765 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i [2022-12-05 22:52:51,777 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3680a78/7278a9613bfb4681a6c5db31e7d2ae01/FLAG1b49e82cc [2022-12-05 22:52:51,787 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3680a78/7278a9613bfb4681a6c5db31e7d2ae01 [2022-12-05 22:52:51,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:52:51,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:52:51,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:51,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:52:51,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:52:51,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:51" (1/1) ... [2022-12-05 22:52:51,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0331f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:51, skipping insertion in model container [2022-12-05 22:52:51,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:51" (1/1) ... [2022-12-05 22:52:51,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:52:51,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:52:52,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,104 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/triangular-longest-1.i[30962,30975] [2022-12-05 22:52:52,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:52,113 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:52:52,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,152 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/triangular-longest-1.i[30962,30975] [2022-12-05 22:52:52,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:52,183 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:52:52,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52 WrapperNode [2022-12-05 22:52:52,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:52,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:52,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:52:52,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:52:52,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,230 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-05 22:52:52,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:52,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:52:52,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:52:52,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:52:52,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,254 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:52:52,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:52:52,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:52:52,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:52:52,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:52,296 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-05 22:52:52,313 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-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:52:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:52:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:52:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:52:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:52:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:52:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:52:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:52:52,323 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:52:52,470 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:52:52,471 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:52:52,632 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:52:52,636 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:52:52,636 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 22:52:52,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:52 BoogieIcfgContainer [2022-12-05 22:52:52,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:52:52,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:52:52,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:52:52,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:52:52,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:52:51" (1/3) ... [2022-12-05 22:52:52,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec22bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:52, skipping insertion in model container [2022-12-05 22:52:52,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (2/3) ... [2022-12-05 22:52:52,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec22bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:52, skipping insertion in model container [2022-12-05 22:52:52,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:52" (3/3) ... [2022-12-05 22:52:52,643 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2022-12-05 22:52:52,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:52:52,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:52:52,661 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:52:52,720 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:52:52,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-05 22:52:52,791 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-05 22:52:52,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:52,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 22:52:52,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-05 22:52:52,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:52,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,844 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-05 22:52:52,845 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:52,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 22:52:52,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-05 22:52:54,705 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-05 22:52:54,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:52:54,725 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;@1a05d7cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:52:54,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:52:54,730 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2022-12-05 22:52:54,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:54,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:54,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:52:54,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -977143138, now seen corresponding path program 1 times [2022-12-05 22:52:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:54,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213765299] [2022-12-05 22:52:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,057 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-05 22:52:55,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213765299] [2022-12-05 22:52:55,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213765299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100423716] [2022-12-05 22:52:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:52:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:52:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:52:55,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 32 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 22:52:55,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,175 INFO L130 PetriNetUnfolder]: 94/152 cut-off events. [2022-12-05 22:52:55,176 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:52:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 152 events. 94/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 395 event pairs, 11 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 306. Up to 76 conditions per place. [2022-12-05 22:52:55,177 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 18 selfloop transitions, 4 changer transitions 4/26 dead transitions. [2022-12-05 22:52:55,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 110 flow [2022-12-05 22:52:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:52:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:52:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-05 22:52:55,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-05 22:52:55,191 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 32 flow. Second operand 4 states and 27 transitions. [2022-12-05 22:52:55,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 26 transitions, 110 flow [2022-12-05 22:52:55,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:55,195 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:55,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=53, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-05 22:52:55,201 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-05 22:52:55,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,202 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:55,204 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:55,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 53 flow [2022-12-05 22:52:55,221 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-05 22:52:55,221 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 22:52:55,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 18 events. 4/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 28. Up to 5 conditions per place. [2022-12-05 22:52:55,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 53 flow [2022-12-05 22:52:55,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 22:52:55,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 20) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:55,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:55,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 22:52:55,260 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 14 transitions, 51 flow [2022-12-05 22:52:55,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 22:52:55,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:52:55,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -226702759, now seen corresponding path program 1 times [2022-12-05 22:52:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455680525] [2022-12-05 22:52:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,350 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-05 22:52:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455680525] [2022-12-05 22:52:55,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455680525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459134252] [2022-12-05 22:52:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:52:55,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:52:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:52:55,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 51 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 22:52:55,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,417 INFO L130 PetriNetUnfolder]: 91/157 cut-off events. [2022-12-05 22:52:55,417 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-05 22:52:55,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 157 events. 91/157 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 450 event pairs, 32 based on Foata normal form. 10/141 useless extension candidates. Maximal degree in co-relation 390. Up to 69 conditions per place. [2022-12-05 22:52:55,418 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 26 selfloop transitions, 5 changer transitions 3/34 dead transitions. [2022-12-05 22:52:55,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 181 flow [2022-12-05 22:52:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:52:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:52:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 22:52:55,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-05 22:52:55,423 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 51 flow. Second operand 5 states and 34 transitions. [2022-12-05 22:52:55,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 181 flow [2022-12-05 22:52:55,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:55,424 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-05 22:52:55,425 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:52:55,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,425 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,425 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,429 INFO L130 PetriNetUnfolder]: 11/32 cut-off events. [2022-12-05 22:52:55,429 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-05 22:52:55,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 32 events. 11/32 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2022-12-05 22:52:55,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-05 22:52:55,433 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:55,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 22:52:55,435 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 22:52:55,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:52:55,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1562125437, now seen corresponding path program 1 times [2022-12-05 22:52:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037852271] [2022-12-05 22:52:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,531 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-05 22:52:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037852271] [2022-12-05 22:52:55,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037852271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703770175] [2022-12-05 22:52:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:55,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 22:52:55,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,634 INFO L130 PetriNetUnfolder]: 91/159 cut-off events. [2022-12-05 22:52:55,635 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-05 22:52:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 159 events. 91/159 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 16 based on Foata normal form. 10/169 useless extension candidates. Maximal degree in co-relation 479. Up to 66 conditions per place. [2022-12-05 22:52:55,639 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 24 selfloop transitions, 12 changer transitions 8/44 dead transitions. [2022-12-05 22:52:55,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 44 transitions, 270 flow [2022-12-05 22:52:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:52:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:52:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-05 22:52:55,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2022-12-05 22:52:55,641 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 7 states and 43 transitions. [2022-12-05 22:52:55,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 44 transitions, 270 flow [2022-12-05 22:52:55,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 44 transitions, 263 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:55,644 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:55,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-05 22:52:55,645 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 16 predicate places. [2022-12-05 22:52:55,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,645 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:55,646 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:55,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:55,651 INFO L130 PetriNetUnfolder]: 16/42 cut-off events. [2022-12-05 22:52:55,651 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-05 22:52:55,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 42 events. 16/42 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 126. Up to 13 conditions per place. [2022-12-05 22:52:55,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:55,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 22:52:55,673 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:55,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 22:52:55,675 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 163 flow [2022-12-05 22:52:55,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 22:52:55,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:52:55,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1436153506, now seen corresponding path program 1 times [2022-12-05 22:52:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295935852] [2022-12-05 22:52:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295935852] [2022-12-05 22:52:55,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295935852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188536180] [2022-12-05 22:52:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:55,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:55,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:55,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 163 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-05 22:52:55,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,835 INFO L130 PetriNetUnfolder]: 115/203 cut-off events. [2022-12-05 22:52:55,835 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-05 22:52:55,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 203 events. 115/203 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 621 event pairs, 28 based on Foata normal form. 8/211 useless extension candidates. Maximal degree in co-relation 728. Up to 63 conditions per place. [2022-12-05 22:52:55,837 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 27 selfloop transitions, 12 changer transitions 4/43 dead transitions. [2022-12-05 22:52:55,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 339 flow [2022-12-05 22:52:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:52:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:52:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-05 22:52:55,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-05 22:52:55,839 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 163 flow. Second operand 6 states and 35 transitions. [2022-12-05 22:52:55,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 339 flow [2022-12-05 22:52:55,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 331 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-05 22:52:55,844 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:55,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-05 22:52:55,845 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 24 predicate places. [2022-12-05 22:52:55,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,845 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:55,847 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:55,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:55,852 INFO L130 PetriNetUnfolder]: 19/53 cut-off events. [2022-12-05 22:52:55,852 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-05 22:52:55,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 53 events. 19/53 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 205. Up to 16 conditions per place. [2022-12-05 22:52:55,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:55,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 22:52:55,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:55,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 22:52:55,861 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:55,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-05 22:52:55,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:52:55,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1617536060, now seen corresponding path program 1 times [2022-12-05 22:52:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096951256] [2022-12-05 22:52:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,942 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-05 22:52:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096951256] [2022-12-05 22:52:55,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096951256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949240729] [2022-12-05 22:52:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:55,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 224 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-05 22:52:55,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,008 INFO L130 PetriNetUnfolder]: 111/199 cut-off events. [2022-12-05 22:52:56,008 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2022-12-05 22:52:56,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 199 events. 111/199 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 626 event pairs, 18 based on Foata normal form. 8/207 useless extension candidates. Maximal degree in co-relation 807. Up to 53 conditions per place. [2022-12-05 22:52:56,009 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 21 selfloop transitions, 17 changer transitions 6/44 dead transitions. [2022-12-05 22:52:56,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 403 flow [2022-12-05 22:52:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:52:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:52:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-05 22:52:56,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-05 22:52:56,011 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 224 flow. Second operand 6 states and 34 transitions. [2022-12-05 22:52:56,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 403 flow [2022-12-05 22:52:56,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 369 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:56,014 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:56,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-12-05 22:52:56,016 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-05 22:52:56,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,016 INFO L89 Accepts]: Start accepts. Operand has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:56,016 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:56,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:56,021 INFO L130 PetriNetUnfolder]: 19/54 cut-off events. [2022-12-05 22:52:56,021 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-05 22:52:56,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 54 events. 19/54 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-12-05 22:52:56,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:56,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 22:52:56,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:56,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:52:56,023 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:56,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-05 22:52:56,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:52:56,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1571201197, now seen corresponding path program 1 times [2022-12-05 22:52:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:56,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833420516] [2022-12-05 22:52:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,102 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-05 22:52:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833420516] [2022-12-05 22:52:56,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833420516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:56,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:56,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452937736] [2022-12-05 22:52:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:56,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:56,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:56,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 285 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-05 22:52:56,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:56,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:56,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,183 INFO L130 PetriNetUnfolder]: 129/235 cut-off events. [2022-12-05 22:52:56,183 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-05 22:52:56,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 235 events. 129/235 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 806 event pairs, 34 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 1012. Up to 126 conditions per place. [2022-12-05 22:52:56,184 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 33 selfloop transitions, 13 changer transitions 11/57 dead transitions. [2022-12-05 22:52:56,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 549 flow [2022-12-05 22:52:56,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-12-05 22:52:56,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-05 22:52:56,185 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 285 flow. Second operand 8 states and 46 transitions. [2022-12-05 22:52:56,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 549 flow [2022-12-05 22:52:56,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 485 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:56,188 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:56,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2022-12-05 22:52:56,190 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-05 22:52:56,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,190 INFO L89 Accepts]: Start accepts. Operand has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:56,191 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:56,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:56,197 INFO L130 PetriNetUnfolder]: 23/65 cut-off events. [2022-12-05 22:52:56,197 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-05 22:52:56,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 65 events. 23/65 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 185 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 265. Up to 20 conditions per place. [2022-12-05 22:52:56,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:56,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-05 22:52:56,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 20)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:56,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 20) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:56,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:56,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-05 22:52:56,253 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 359 flow [2022-12-05 22:52:56,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-05 22:52:56,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,253 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:52:56,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1458297736, now seen corresponding path program 2 times [2022-12-05 22:52:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:56,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201351647] [2022-12-05 22:52:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201351647] [2022-12-05 22:52:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201351647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115924109] [2022-12-05 22:52:56,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:52:56,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:56,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:56,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:56,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 22:52:56,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:52:56,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:56,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 22:52:56,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115924109] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:56,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:56,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-05 22:52:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682920251] [2022-12-05 22:52:56,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 22:52:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 22:52:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-05 22:52:56,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:56,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 359 flow. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-05 22:52:56,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:56,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:56,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,731 INFO L130 PetriNetUnfolder]: 185/331 cut-off events. [2022-12-05 22:52:56,731 INFO L131 PetriNetUnfolder]: For 1491/1491 co-relation queries the response was YES. [2022-12-05 22:52:56,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 331 events. 185/331 cut-off events. For 1491/1491 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1163 event pairs, 20 based on Foata normal form. 16/347 useless extension candidates. Maximal degree in co-relation 1450. Up to 79 conditions per place. [2022-12-05 22:52:56,733 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 28 selfloop transitions, 35 changer transitions 21/84 dead transitions. [2022-12-05 22:52:56,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 840 flow [2022-12-05 22:52:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:52:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:52:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-05 22:52:56,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-05 22:52:56,735 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 359 flow. Second operand 13 states and 70 transitions. [2022-12-05 22:52:56,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 840 flow [2022-12-05 22:52:56,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 794 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:56,740 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 629 flow [2022-12-05 22:52:56,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=629, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2022-12-05 22:52:56,741 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 52 predicate places. [2022-12-05 22:52:56,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,741 INFO L89 Accepts]: Start accepts. Operand has 70 places, 52 transitions, 629 flow [2022-12-05 22:52:56,742 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 52 transitions, 629 flow [2022-12-05 22:52:56,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 52 transitions, 629 flow [2022-12-05 22:52:56,753 INFO L130 PetriNetUnfolder]: 36/97 cut-off events. [2022-12-05 22:52:56,753 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-12-05 22:52:56,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 97 events. 36/97 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 297 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 474. Up to 33 conditions per place. [2022-12-05 22:52:56,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 52 transitions, 629 flow [2022-12-05 22:52:56,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-05 22:52:56,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:56,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-05 22:52:56,776 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 595 flow [2022-12-05 22:52:56,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-05 22:52:56,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,776 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:56,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:56,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 531828353, now seen corresponding path program 1 times [2022-12-05 22:52:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:56,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341783581] [2022-12-05 22:52:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:57,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341783581] [2022-12-05 22:52:57,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341783581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:57,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289474768] [2022-12-05 22:52:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:57,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:57,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:57,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:57,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 22:52:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:57,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 22:52:57,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:57,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289474768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:57,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:57,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-05 22:52:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129484506] [2022-12-05 22:52:57,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 22:52:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 22:52:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-05 22:52:57,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:57,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 595 flow. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-05 22:52:57,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:57,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:57,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:57,646 INFO L130 PetriNetUnfolder]: 238/450 cut-off events. [2022-12-05 22:52:57,646 INFO L131 PetriNetUnfolder]: For 3575/3575 co-relation queries the response was YES. [2022-12-05 22:52:57,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 450 events. 238/450 cut-off events. For 3575/3575 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1731 event pairs, 40 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 2247. Up to 155 conditions per place. [2022-12-05 22:52:57,649 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 56 selfloop transitions, 37 changer transitions 32/125 dead transitions. [2022-12-05 22:52:57,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 1450 flow [2022-12-05 22:52:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 22:52:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 22:52:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2022-12-05 22:52:57,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34035087719298246 [2022-12-05 22:52:57,652 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 595 flow. Second operand 19 states and 97 transitions. [2022-12-05 22:52:57,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 1450 flow [2022-12-05 22:52:57,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1101 flow, removed 156 selfloop flow, removed 7 redundant places. [2022-12-05 22:52:57,662 INFO L231 Difference]: Finished difference. Result has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:57,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=764, PETRI_PLACES=92, PETRI_TRANSITIONS=67} [2022-12-05 22:52:57,663 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 74 predicate places. [2022-12-05 22:52:57,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:57,663 INFO L89 Accepts]: Start accepts. Operand has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:57,665 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:57,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:57,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:57,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:57,677 INFO L130 PetriNetUnfolder]: 51/148 cut-off events. [2022-12-05 22:52:57,677 INFO L131 PetriNetUnfolder]: For 1363/1363 co-relation queries the response was YES. [2022-12-05 22:52:57,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 148 events. 51/148 cut-off events. For 1363/1363 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 520 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 769. Up to 51 conditions per place. [2022-12-05 22:52:57,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:57,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 22:52:57,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:57,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 22:52:57,681 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-05 22:52:57,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:57,682 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:57,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:57,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-05 22:52:57,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1259191637, now seen corresponding path program 2 times [2022-12-05 22:52:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:57,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13439417] [2022-12-05 22:52:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:57,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:57,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13439417] [2022-12-05 22:52:57,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13439417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:57,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107162088] [2022-12-05 22:52:57,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:52:57,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:58,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 22:52:58,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:52:58,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:58,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-05 22:52:58,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:58,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:58,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107162088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:58,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:58,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-05 22:52:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834437881] [2022-12-05 22:52:58,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 22:52:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 22:52:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-05 22:52:58,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:58,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 67 transitions, 764 flow. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-05 22:52:58,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:58,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:58,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:58,567 INFO L130 PetriNetUnfolder]: 362/698 cut-off events. [2022-12-05 22:52:58,567 INFO L131 PetriNetUnfolder]: For 10721/10721 co-relation queries the response was YES. [2022-12-05 22:52:58,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3832 conditions, 698 events. 362/698 cut-off events. For 10721/10721 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3158 event pairs, 37 based on Foata normal form. 32/730 useless extension candidates. Maximal degree in co-relation 3786. Up to 175 conditions per place. [2022-12-05 22:52:58,572 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 48 selfloop transitions, 73 changer transitions 35/156 dead transitions. [2022-12-05 22:52:58,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 1957 flow [2022-12-05 22:52:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 22:52:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 22:52:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-12-05 22:52:58,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33 [2022-12-05 22:52:58,573 INFO L175 Difference]: Start difference. First operand has 92 places, 67 transitions, 764 flow. Second operand 20 states and 99 transitions. [2022-12-05 22:52:58,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 1957 flow [2022-12-05 22:52:58,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1769 flow, removed 82 selfloop flow, removed 6 redundant places. [2022-12-05 22:52:58,589 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 1347 flow [2022-12-05 22:52:58,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1347, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2022-12-05 22:52:58,590 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 99 predicate places. [2022-12-05 22:52:58,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:58,590 INFO L89 Accepts]: Start accepts. Operand has 117 places, 99 transitions, 1347 flow [2022-12-05 22:52:58,592 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:58,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:58,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 99 transitions, 1347 flow [2022-12-05 22:52:58,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 99 transitions, 1347 flow [2022-12-05 22:52:58,612 INFO L130 PetriNetUnfolder]: 84/242 cut-off events. [2022-12-05 22:52:58,612 INFO L131 PetriNetUnfolder]: For 5515/5515 co-relation queries the response was YES. [2022-12-05 22:52:58,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 242 events. 84/242 cut-off events. For 5515/5515 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1043 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1686. Up to 82 conditions per place. [2022-12-05 22:52:58,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 99 transitions, 1347 flow [2022-12-05 22:52:58,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-05 22:52:58,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 20) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:58,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 20)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:58,665 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:52:58,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-05 22:52:58,666 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 1349 flow [2022-12-05 22:52:58,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-05 22:52:58,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:58,666 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:58,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 22:52:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:58,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -835740951, now seen corresponding path program 3 times [2022-12-05 22:52:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:58,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158650603] [2022-12-05 22:52:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:58,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158650603] [2022-12-05 22:52:58,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158650603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:58,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908309187] [2022-12-05 22:52:58,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 22:52:58,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:58,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:58,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:58,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 22:52:59,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 22:52:59,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:59,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 22:52:59,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:59,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:52:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908309187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:59,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-05 22:52:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718623722] [2022-12-05 22:52:59,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 22:52:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 22:52:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-05 22:52:59,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 22:52:59,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 98 transitions, 1349 flow. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-05 22:52:59,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:59,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 22:52:59,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:59,964 INFO L130 PetriNetUnfolder]: 582/1110 cut-off events. [2022-12-05 22:52:59,964 INFO L131 PetriNetUnfolder]: For 33102/33102 co-relation queries the response was YES. [2022-12-05 22:52:59,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 1110 events. 582/1110 cut-off events. For 33102/33102 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5718 event pairs, 34 based on Foata normal form. 32/1142 useless extension candidates. Maximal degree in co-relation 7629. Up to 273 conditions per place. [2022-12-05 22:52:59,971 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 61 selfloop transitions, 100 changer transitions 65/226 dead transitions. [2022-12-05 22:52:59,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 226 transitions, 3428 flow [2022-12-05 22:52:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:52:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:52:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 129 transitions. [2022-12-05 22:52:59,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3035294117647059 [2022-12-05 22:52:59,984 INFO L175 Difference]: Start difference. First operand has 117 places, 98 transitions, 1349 flow. Second operand 25 states and 129 transitions. [2022-12-05 22:52:59,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 226 transitions, 3428 flow [2022-12-05 22:53:00,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 226 transitions, 3033 flow, removed 168 selfloop flow, removed 8 redundant places. [2022-12-05 22:53:00,031 INFO L231 Difference]: Finished difference. Result has 147 places, 122 transitions, 1980 flow [2022-12-05 22:53:00,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1980, PETRI_PLACES=147, PETRI_TRANSITIONS=122} [2022-12-05 22:53:00,032 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 129 predicate places. [2022-12-05 22:53:00,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:00,032 INFO L89 Accepts]: Start accepts. Operand has 147 places, 122 transitions, 1980 flow [2022-12-05 22:53:00,036 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:00,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:00,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 122 transitions, 1980 flow [2022-12-05 22:53:00,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 122 transitions, 1980 flow [2022-12-05 22:53:00,098 INFO L130 PetriNetUnfolder]: 106/296 cut-off events. [2022-12-05 22:53:00,098 INFO L131 PetriNetUnfolder]: For 14614/14614 co-relation queries the response was YES. [2022-12-05 22:53:00,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 296 events. 106/296 cut-off events. For 14614/14614 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1379 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 2751. Up to 97 conditions per place. [2022-12-05 22:53:00,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 122 transitions, 1980 flow [2022-12-05 22:53:00,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-05 22:53:00,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:00,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-05 22:53:00,114 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 120 transitions, 1961 flow [2022-12-05 22:53:00,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-05 22:53:00,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:00,114 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:00,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 22:53:00,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:00,318 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1685771555, now seen corresponding path program 4 times [2022-12-05 22:53:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:00,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287197501] [2022-12-05 22:53:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 22:53:00,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:00,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287197501] [2022-12-05 22:53:00,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287197501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:00,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961907692] [2022-12-05 22:53:00,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 22:53:00,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:00,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:00,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:00,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 22:53:00,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 22:53:00,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:53:00,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 22:53:00,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 22:53:00,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 22:53:00,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961907692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:00,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:00,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-05 22:53:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199386488] [2022-12-05 22:53:00,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:00,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-05 22:53:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-05 22:53:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-12-05 22:53:00,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:53:00,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 120 transitions, 1961 flow. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 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-05 22:53:00,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:00,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:53:00,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:01,366 INFO L130 PetriNetUnfolder]: 852/1584 cut-off events. [2022-12-05 22:53:01,366 INFO L131 PetriNetUnfolder]: For 85506/85506 co-relation queries the response was YES. [2022-12-05 22:53:01,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14726 conditions, 1584 events. 852/1584 cut-off events. For 85506/85506 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8341 event pairs, 37 based on Foata normal form. 32/1616 useless extension candidates. Maximal degree in co-relation 14656. Up to 373 conditions per place. [2022-12-05 22:53:01,379 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 58 selfloop transitions, 151 changer transitions 80/289 dead transitions. [2022-12-05 22:53:01,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 289 transitions, 6028 flow [2022-12-05 22:53:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 22:53:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 22:53:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 143 transitions. [2022-12-05 22:53:01,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32873563218390806 [2022-12-05 22:53:01,380 INFO L175 Difference]: Start difference. First operand has 147 places, 120 transitions, 1961 flow. Second operand 29 states and 143 transitions. [2022-12-05 22:53:01,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 289 transitions, 6028 flow [2022-12-05 22:53:01,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 289 transitions, 4503 flow, removed 710 selfloop flow, removed 25 redundant places. [2022-12-05 22:53:01,489 INFO L231 Difference]: Finished difference. Result has 161 places, 186 transitions, 3261 flow [2022-12-05 22:53:01,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3261, PETRI_PLACES=161, PETRI_TRANSITIONS=186} [2022-12-05 22:53:01,490 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 143 predicate places. [2022-12-05 22:53:01,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:01,490 INFO L89 Accepts]: Start accepts. Operand has 161 places, 186 transitions, 3261 flow [2022-12-05 22:53:01,493 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:01,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:01,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 186 transitions, 3261 flow [2022-12-05 22:53:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 186 transitions, 3261 flow [2022-12-05 22:53:01,555 INFO L130 PetriNetUnfolder]: 160/447 cut-off events. [2022-12-05 22:53:01,555 INFO L131 PetriNetUnfolder]: For 27932/27932 co-relation queries the response was YES. [2022-12-05 22:53:01,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4585 conditions, 447 events. 160/447 cut-off events. For 27932/27932 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2241 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 4515. Up to 149 conditions per place. [2022-12-05 22:53:01,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 186 transitions, 3261 flow [2022-12-05 22:53:01,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-05 22:53:01,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:01,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-05 22:53:01,574 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 182 transitions, 3223 flow [2022-12-05 22:53:01,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 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-05 22:53:01,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:01,574 INFO L213 CegarLoopForPetriNet]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:01,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-05 22:53:01,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-05 22:53:01,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -551833473, now seen corresponding path program 3 times [2022-12-05 22:53:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:01,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896907095] [2022-12-05 22:53:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:01,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896907095] [2022-12-05 22:53:01,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896907095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:01,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379139081] [2022-12-05 22:53:01,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 22:53:01,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:01,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:01,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 22:53:02,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-05 22:53:02,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:53:02,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:53:02,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:02,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379139081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:02,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:02,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2022-12-05 22:53:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513211234] [2022-12-05 22:53:02,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:02,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-05 22:53:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-05 22:53:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2022-12-05 22:53:02,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:53:02,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 182 transitions, 3223 flow. Second operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:02,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:02,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:53:02,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:03,214 INFO L130 PetriNetUnfolder]: 748/1440 cut-off events. [2022-12-05 22:53:03,214 INFO L131 PetriNetUnfolder]: For 113500/113500 co-relation queries the response was YES. [2022-12-05 22:53:03,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13607 conditions, 1440 events. 748/1440 cut-off events. For 113500/113500 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7148 event pairs, 270 based on Foata normal form. 64/1504 useless extension candidates. Maximal degree in co-relation 13534. Up to 1056 conditions per place. [2022-12-05 22:53:03,227 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 142 selfloop transitions, 48 changer transitions 106/296 dead transitions. [2022-12-05 22:53:03,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 296 transitions, 6240 flow [2022-12-05 22:53:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-05 22:53:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-05 22:53:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 151 transitions. [2022-12-05 22:53:03,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3247311827956989 [2022-12-05 22:53:03,229 INFO L175 Difference]: Start difference. First operand has 161 places, 182 transitions, 3223 flow. Second operand 31 states and 151 transitions. [2022-12-05 22:53:03,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 296 transitions, 6240 flow [2022-12-05 22:53:03,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 296 transitions, 4630 flow, removed 762 selfloop flow, removed 12 redundant places. [2022-12-05 22:53:03,338 INFO L231 Difference]: Finished difference. Result has 195 places, 151 transitions, 2413 flow [2022-12-05 22:53:03,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2413, PETRI_PLACES=195, PETRI_TRANSITIONS=151} [2022-12-05 22:53:03,338 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 177 predicate places. [2022-12-05 22:53:03,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:03,338 INFO L89 Accepts]: Start accepts. Operand has 195 places, 151 transitions, 2413 flow [2022-12-05 22:53:03,341 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:03,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:03,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 151 transitions, 2413 flow [2022-12-05 22:53:03,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 151 transitions, 2413 flow [2022-12-05 22:53:03,380 INFO L130 PetriNetUnfolder]: 128/380 cut-off events. [2022-12-05 22:53:03,380 INFO L131 PetriNetUnfolder]: For 29355/29355 co-relation queries the response was YES. [2022-12-05 22:53:03,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 380 events. 128/380 cut-off events. For 29355/29355 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1563 event pairs, 0 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 3653. Up to 127 conditions per place. [2022-12-05 22:53:03,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 151 transitions, 2413 flow [2022-12-05 22:53:03,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-05 22:53:03,388 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:03,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-05 22:53:03,388 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 151 transitions, 2413 flow [2022-12-05 22:53:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:03,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:03,389 INFO L213 CegarLoopForPetriNet]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:03,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-05 22:53:03,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:03,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2113716159, now seen corresponding path program 2 times [2022-12-05 22:53:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:03,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270310812] [2022-12-05 22:53:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270310812] [2022-12-05 22:53:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270310812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352307775] [2022-12-05 22:53:03,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:53:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:03,809 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:03,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 22:53:03,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:53:03,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:53:03,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:53:03,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:03,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:04,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352307775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:04,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:04,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-12-05 22:53:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816821221] [2022-12-05 22:53:04,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:04,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-05 22:53:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:04,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-05 22:53:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2022-12-05 22:53:04,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:53:04,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 151 transitions, 2413 flow. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:04,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:04,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:53:04,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:04,970 INFO L130 PetriNetUnfolder]: 604/1188 cut-off events. [2022-12-05 22:53:04,970 INFO L131 PetriNetUnfolder]: For 136757/136757 co-relation queries the response was YES. [2022-12-05 22:53:04,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11147 conditions, 1188 events. 604/1188 cut-off events. For 136757/136757 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5302 event pairs, 110 based on Foata normal form. 64/1252 useless extension candidates. Maximal degree in co-relation 11061. Up to 431 conditions per place. [2022-12-05 22:53:04,984 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 111 selfloop transitions, 94 changer transitions 65/270 dead transitions. [2022-12-05 22:53:04,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 270 transitions, 5456 flow [2022-12-05 22:53:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-05 22:53:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-05 22:53:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 168 transitions. [2022-12-05 22:53:04,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-05 22:53:04,986 INFO L175 Difference]: Start difference. First operand has 194 places, 151 transitions, 2413 flow. Second operand 35 states and 168 transitions. [2022-12-05 22:53:04,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 270 transitions, 5456 flow [2022-12-05 22:53:05,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 270 transitions, 4618 flow, removed 346 selfloop flow, removed 22 redundant places. [2022-12-05 22:53:05,088 INFO L231 Difference]: Finished difference. Result has 222 places, 167 transitions, 2829 flow [2022-12-05 22:53:05,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2829, PETRI_PLACES=222, PETRI_TRANSITIONS=167} [2022-12-05 22:53:05,089 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 204 predicate places. [2022-12-05 22:53:05,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:05,089 INFO L89 Accepts]: Start accepts. Operand has 222 places, 167 transitions, 2829 flow [2022-12-05 22:53:05,094 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:05,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:05,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 167 transitions, 2829 flow [2022-12-05 22:53:05,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 167 transitions, 2829 flow [2022-12-05 22:53:05,136 INFO L130 PetriNetUnfolder]: 144/428 cut-off events. [2022-12-05 22:53:05,136 INFO L131 PetriNetUnfolder]: For 53071/53071 co-relation queries the response was YES. [2022-12-05 22:53:05,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 428 events. 144/428 cut-off events. For 53071/53071 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1717 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 4888. Up to 143 conditions per place. [2022-12-05 22:53:05,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 167 transitions, 2829 flow [2022-12-05 22:53:05,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-05 22:53:05,145 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:05,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-05 22:53:05,146 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 167 transitions, 2829 flow [2022-12-05 22:53:05,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:05,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:05,146 INFO L213 CegarLoopForPetriNet]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:05,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-05 22:53:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:05,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -48882893, now seen corresponding path program 5 times [2022-12-05 22:53:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:05,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618569080] [2022-12-05 22:53:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618569080] [2022-12-05 22:53:05,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618569080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135962135] [2022-12-05 22:53:05,532 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 22:53:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:05,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:05,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-05 22:53:05,605 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-12-05 22:53:05,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:53:05,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:53:05,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:05,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:53:05,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135962135] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:05,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:05,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2022-12-05 22:53:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110651384] [2022-12-05 22:53:05,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:05,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-05 22:53:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-05 22:53:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2022-12-05 22:53:05,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:53:05,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 167 transitions, 2829 flow. Second operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:05,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:05,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:53:05,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:07,125 INFO L130 PetriNetUnfolder]: 844/1620 cut-off events. [2022-12-05 22:53:07,125 INFO L131 PetriNetUnfolder]: For 274146/274146 co-relation queries the response was YES. [2022-12-05 22:53:07,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17666 conditions, 1620 events. 844/1620 cut-off events. For 274146/274146 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7604 event pairs, 16 based on Foata normal form. 68/1688 useless extension candidates. Maximal degree in co-relation 17569. Up to 395 conditions per place. [2022-12-05 22:53:07,142 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 96 selfloop transitions, 204 changer transitions 105/405 dead transitions. [2022-12-05 22:53:07,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 405 transitions, 9277 flow [2022-12-05 22:53:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-05 22:53:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-05 22:53:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 266 transitions. [2022-12-05 22:53:07,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-05 22:53:07,149 INFO L175 Difference]: Start difference. First operand has 222 places, 167 transitions, 2829 flow. Second operand 56 states and 266 transitions. [2022-12-05 22:53:07,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 405 transitions, 9277 flow [2022-12-05 22:53:07,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 405 transitions, 8315 flow, removed 424 selfloop flow, removed 18 redundant places. [2022-12-05 22:53:07,413 INFO L231 Difference]: Finished difference. Result has 291 places, 232 transitions, 5008 flow [2022-12-05 22:53:07,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=5008, PETRI_PLACES=291, PETRI_TRANSITIONS=232} [2022-12-05 22:53:07,414 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 273 predicate places. [2022-12-05 22:53:07,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:07,414 INFO L89 Accepts]: Start accepts. Operand has 291 places, 232 transitions, 5008 flow [2022-12-05 22:53:07,432 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:07,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:07,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 232 transitions, 5008 flow [2022-12-05 22:53:07,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 232 transitions, 5008 flow [2022-12-05 22:53:07,510 INFO L130 PetriNetUnfolder]: 201/571 cut-off events. [2022-12-05 22:53:07,510 INFO L131 PetriNetUnfolder]: For 151177/151177 co-relation queries the response was YES. [2022-12-05 22:53:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9174 conditions, 571 events. 201/571 cut-off events. For 151177/151177 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2564 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 9048. Up to 191 conditions per place. [2022-12-05 22:53:07,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 232 transitions, 5008 flow [2022-12-05 22:53:07,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-05 22:53:07,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 20)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:53:07,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 20) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:53:07,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [242] L714-4-->L704-5: Formula: (and (= (+ v_t2Thread1of1ForFork1_~k~1_143 1) v_t2Thread1of1ForFork1_~k~1_142) (< v_t2Thread1of1ForFork1_~k~1_143 20) (= |v_ULTIMATE.start_main_~condI~0#1_111| (ite (< 46 v_~i~0_203) 1 0)) (= v_~j~0_187 (+ v_~i~0_203 1))) InVars {~i~0=v_~i~0_203, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_143} OutVars{~j~0=v_~j~0_187, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_90|, ~i~0=v_~i~0_203, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_81|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_111|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_142} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1, t2Thread1of1ForFork1_~k~1] and [213] L717-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_~condJ~0#1_19| (ite (< 46 v_~j~0_31) 1 0)) (or (not (= |v_ULTIMATE.start_main_~condI~0#1_21| 0)) (not (= |v_ULTIMATE.start_main_~condJ~0#1_19| 0)))) InVars {~j~0=v_~j~0_31, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_21|} OutVars{~j~0=v_~j~0_31, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_19|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] [2022-12-05 22:53:07,625 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:07,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-05 22:53:07,625 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 227 transitions, 4998 flow [2022-12-05 22:53:07,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:07,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:07,626 INFO L213 CegarLoopForPetriNet]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:07,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-05 22:53:07,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-05 22:53:07,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2068928958, now seen corresponding path program 6 times [2022-12-05 22:53:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:07,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838034105] [2022-12-05 22:53:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838034105] [2022-12-05 22:53:08,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838034105] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764173773] [2022-12-05 22:53:08,140 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 22:53:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:08,141 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:08,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 22:53:08,211 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-12-05 22:53:08,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:53:08,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-05 22:53:08,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:08,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:08,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764173773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:08,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:08,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 44 [2022-12-05 22:53:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872644706] [2022-12-05 22:53:08,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:08,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-05 22:53:08,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-05 22:53:08,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1571, Unknown=0, NotChecked=0, Total=2070 [2022-12-05 22:53:08,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 22:53:08,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 227 transitions, 4998 flow. Second operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 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-05 22:53:08,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:08,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 22:53:08,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:10,976 INFO L130 PetriNetUnfolder]: 1316/2488 cut-off events. [2022-12-05 22:53:10,976 INFO L131 PetriNetUnfolder]: For 760283/760283 co-relation queries the response was YES. [2022-12-05 22:53:10,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41468 conditions, 2488 events. 1316/2488 cut-off events. For 760283/760283 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11687 event pairs, 13 based on Foata normal form. 84/2572 useless extension candidates. Maximal degree in co-relation 41339. Up to 593 conditions per place. [2022-12-05 22:53:11,004 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 112 selfloop transitions, 249 changer transitions 203/564 dead transitions. [2022-12-05 22:53:11,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 564 transitions, 19604 flow [2022-12-05 22:53:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-05 22:53:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2022-12-05 22:53:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 393 transitions. [2022-12-05 22:53:11,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29593373493975905 [2022-12-05 22:53:11,008 INFO L175 Difference]: Start difference. First operand has 291 places, 227 transitions, 4998 flow. Second operand 83 states and 393 transitions. [2022-12-05 22:53:11,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 564 transitions, 19604 flow [2022-12-05 22:53:11,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 564 transitions, 13718 flow, removed 2883 selfloop flow, removed 19 redundant places. [2022-12-05 22:53:11,654 INFO L231 Difference]: Finished difference. Result has 393 places, 277 transitions, 6791 flow [2022-12-05 22:53:11,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2721, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=6791, PETRI_PLACES=393, PETRI_TRANSITIONS=277} [2022-12-05 22:53:11,655 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 375 predicate places. [2022-12-05 22:53:11,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:11,655 INFO L89 Accepts]: Start accepts. Operand has 393 places, 277 transitions, 6791 flow [2022-12-05 22:53:11,702 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:11,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:11,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 277 transitions, 6791 flow [2022-12-05 22:53:11,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 277 transitions, 6791 flow [2022-12-05 22:53:11,818 INFO L130 PetriNetUnfolder]: 248/697 cut-off events. [2022-12-05 22:53:11,818 INFO L131 PetriNetUnfolder]: For 281417/281417 co-relation queries the response was YES. [2022-12-05 22:53:11,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14027 conditions, 697 events. 248/697 cut-off events. For 281417/281417 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2913 event pairs, 0 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 13862. Up to 229 conditions per place. [2022-12-05 22:53:11,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 277 transitions, 6791 flow [2022-12-05 22:53:11,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-05 22:53:11,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 20)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:53:11,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 20) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:53:11,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 46 v_~i~0_26) 1 0)) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 20)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:53:11,924 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:53:11,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-05 22:53:11,924 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 266 transitions, 6951 flow [2022-12-05 22:53:11,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 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-05 22:53:11,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:11,925 INFO L213 CegarLoopForPetriNet]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:11,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-05 22:53:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-05 22:53:12,132 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1365326477, now seen corresponding path program 7 times [2022-12-05 22:53:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626356598] [2022-12-05 22:53:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626356598] [2022-12-05 22:53:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626356598] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835644514] [2022-12-05 22:53:12,920 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 22:53:12,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:12,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:12,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:12,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-05 22:53:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:13,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-05 22:53:13,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:13,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:13,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835644514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:13,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:13,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2022-12-05 22:53:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974971566] [2022-12-05 22:53:13,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-12-05 22:53:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-12-05 22:53:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1745, Invalid=5737, Unknown=0, NotChecked=0, Total=7482 [2022-12-05 22:53:13,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:53:13,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 266 transitions, 6951 flow. Second operand has 87 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 86 states have internal predecessors, (98), 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-05 22:53:13,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:13,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:53:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:17,211 INFO L130 PetriNetUnfolder]: 1240/2408 cut-off events. [2022-12-05 22:53:17,212 INFO L131 PetriNetUnfolder]: For 787391/787391 co-relation queries the response was YES. [2022-12-05 22:53:17,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45607 conditions, 2408 events. 1240/2408 cut-off events. For 787391/787391 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11254 event pairs, 26 based on Foata normal form. 12/2420 useless extension candidates. Maximal degree in co-relation 45439. Up to 668 conditions per place. [2022-12-05 22:53:17,240 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 130 selfloop transitions, 245 changer transitions 202/577 dead transitions. [2022-12-05 22:53:17,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 577 transitions, 21295 flow [2022-12-05 22:53:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-05 22:53:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-12-05 22:53:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 378 transitions. [2022-12-05 22:53:17,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2413793103448276 [2022-12-05 22:53:17,242 INFO L175 Difference]: Start difference. First operand has 393 places, 266 transitions, 6951 flow. Second operand 87 states and 378 transitions. [2022-12-05 22:53:17,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 577 transitions, 21295 flow [2022-12-05 22:53:18,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 577 transitions, 13552 flow, removed 3710 selfloop flow, removed 52 redundant places. [2022-12-05 22:53:18,881 INFO L231 Difference]: Finished difference. Result has 435 places, 276 transitions, 4327 flow [2022-12-05 22:53:18,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=3184, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=4327, PETRI_PLACES=435, PETRI_TRANSITIONS=276} [2022-12-05 22:53:18,882 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 417 predicate places. [2022-12-05 22:53:18,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:18,882 INFO L89 Accepts]: Start accepts. Operand has 435 places, 276 transitions, 4327 flow [2022-12-05 22:53:18,899 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:18,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:18,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 276 transitions, 4327 flow [2022-12-05 22:53:18,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 434 places, 276 transitions, 4327 flow [2022-12-05 22:53:19,111 INFO L130 PetriNetUnfolder]: 251/729 cut-off events. [2022-12-05 22:53:19,111 INFO L131 PetriNetUnfolder]: For 273781/273781 co-relation queries the response was YES. [2022-12-05 22:53:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12833 conditions, 729 events. 251/729 cut-off events. For 273781/273781 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3005 event pairs, 0 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 12674. Up to 243 conditions per place. [2022-12-05 22:53:19,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 276 transitions, 4327 flow [2022-12-05 22:53:19,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-05 22:53:19,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:19,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-05 22:53:19,140 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 271 transitions, 4267 flow [2022-12-05 22:53:19,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 86 states have internal predecessors, (98), 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-05 22:53:19,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:19,140 INFO L213 CegarLoopForPetriNet]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:19,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-05 22:53:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-05 22:53:19,345 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1532640075, now seen corresponding path program 1 times [2022-12-05 22:53:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:19,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880633167] [2022-12-05 22:53:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 381 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880633167] [2022-12-05 22:53:19,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880633167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646319478] [2022-12-05 22:53:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:19,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:19,660 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:53:19,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-05 22:53:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:19,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-05 22:53:19,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:19,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:53:19,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646319478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:19,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:53:19,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 24 [2022-12-05 22:53:19,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272015624] [2022-12-05 22:53:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:19,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:53:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:53:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2022-12-05 22:53:19,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:53:19,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 271 transitions, 4267 flow. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:19,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:19,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:53:19,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:24,240 INFO L130 PetriNetUnfolder]: 11328/17739 cut-off events. [2022-12-05 22:53:24,240 INFO L131 PetriNetUnfolder]: For 5330291/5330291 co-relation queries the response was YES. [2022-12-05 22:53:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253427 conditions, 17739 events. 11328/17739 cut-off events. For 5330291/5330291 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 103003 event pairs, 22 based on Foata normal form. 499/18238 useless extension candidates. Maximal degree in co-relation 253265. Up to 7375 conditions per place. [2022-12-05 22:53:24,477 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 0 selfloop transitions, 0 changer transitions 3205/3205 dead transitions. [2022-12-05 22:53:24,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 3205 transitions, 51316 flow [2022-12-05 22:53:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 22:53:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 22:53:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 173 transitions. [2022-12-05 22:53:24,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4178743961352657 [2022-12-05 22:53:24,479 INFO L175 Difference]: Start difference. First operand has 435 places, 271 transitions, 4267 flow. Second operand 23 states and 173 transitions. [2022-12-05 22:53:24,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 3205 transitions, 51316 flow [2022-12-05 22:53:27,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 3205 transitions, 42814 flow, removed 424 selfloop flow, removed 102 redundant places. [2022-12-05 22:53:27,426 INFO L231 Difference]: Finished difference. Result has 354 places, 0 transitions, 0 flow [2022-12-05 22:53:27,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=2853, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=0, PETRI_PLACES=354, PETRI_TRANSITIONS=0} [2022-12-05 22:53:27,427 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 336 predicate places. [2022-12-05 22:53:27,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:27,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 0 transitions, 0 flow [2022-12-05 22:53:27,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 22:53:27,428 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 22:53:27,428 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 22:53:27,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 22:53:27,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 22:53:27,428 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:27,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-05 22:53:27,428 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 22:53:27,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:27,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:53:27,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:53:27,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:53:27,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-05 22:53:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-05 22:53:27,636 INFO L458 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1] [2022-12-05 22:53:27,638 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:53:27,638 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:53:27,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:53:27 BasicIcfg [2022-12-05 22:53:27,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:53:27,642 INFO L158 Benchmark]: Toolchain (without parser) took 35852.01ms. Allocated memory was 255.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 230.8MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 707.6MB. Max. memory is 8.0GB. [2022-12-05 22:53:27,642 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory was 231.7MB in the beginning and 231.6MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:53:27,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.61ms. Allocated memory is still 255.9MB. Free memory was 230.8MB in the beginning and 210.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-05 22:53:27,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.14ms. Allocated memory is still 255.9MB. Free memory was 210.3MB in the beginning and 208.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:27,653 INFO L158 Benchmark]: Boogie Preprocessor took 25.26ms. Allocated memory is still 255.9MB. Free memory was 208.4MB in the beginning and 206.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:53:27,653 INFO L158 Benchmark]: RCFGBuilder took 381.66ms. Allocated memory is still 255.9MB. Free memory was 206.9MB in the beginning and 194.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 22:53:27,654 INFO L158 Benchmark]: TraceAbstraction took 35002.05ms. Allocated memory was 255.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 194.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 670.9MB. Max. memory is 8.0GB. [2022-12-05 22:53:27,656 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.10ms. Allocated memory is still 255.9MB. Free memory was 231.7MB in the beginning and 231.6MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 393.61ms. Allocated memory is still 255.9MB. Free memory was 230.8MB in the beginning and 210.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.14ms. Allocated memory is still 255.9MB. Free memory was 210.3MB in the beginning and 208.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.26ms. Allocated memory is still 255.9MB. Free memory was 208.4MB in the beginning and 206.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 381.66ms. Allocated memory is still 255.9MB. Free memory was 206.9MB in the beginning and 194.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35002.05ms. Allocated memory was 255.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 194.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 670.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 66 PlacesBefore, 18 PlacesAfterwards, 64 TransitionsBefore, 13 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 30 ConcurrentYvCompositions, 3 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 598, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 598, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 598, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 613, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 598, unknown conditional: 0, unknown unconditional: 598] , Statistics on independence cache: Total cache size (in pairs): 1033, Positive cache size: 1023, Positive conditional cache size: 0, Positive unconditional cache size: 1023, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 4, independent unconditional: 4, 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: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 4, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 8, Positive conditional cache size: 4, Positive unconditional cache size: 4, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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, 27 TransitionsBefore, 27 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, 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, 48 PlacesBefore, 48 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, 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, 56 PlacesBefore, 56 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 10, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 13, Positive conditional cache size: 7, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, 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, 69 PlacesBefore, 69 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, 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: 20, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 19, Positive conditional cache size: 13, Positive unconditional cache size: 6, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 19, Positive conditional cache size: 13, Positive unconditional cache size: 6, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 117 PlacesBefore, 117 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 21, Positive conditional cache size: 14, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 146 PlacesBefore, 147 PlacesAfterwards, 122 TransitionsBefore, 120 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 23, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 160 PlacesBefore, 161 PlacesAfterwards, 186 TransitionsBefore, 182 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 33, independent conditional: 31, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 45, Positive conditional cache size: 38, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 194 PlacesBefore, 194 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 45, Positive conditional cache size: 38, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 222 PlacesBefore, 222 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 45, Positive conditional cache size: 38, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 291 PlacesBefore, 291 PlacesAfterwards, 232 TransitionsBefore, 227 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 30, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 30, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 30, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 60, Positive conditional cache size: 53, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 392 PlacesBefore, 393 PlacesAfterwards, 277 TransitionsBefore, 266 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 90, Positive conditional cache size: 83, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 434 PlacesBefore, 435 PlacesAfterwards, 276 TransitionsBefore, 271 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 95, Positive conditional cache size: 88, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 95, Positive conditional cache size: 88, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 722]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 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: 34.9s, OverallIterations: 17, TraceHistogramMax: 21, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5312 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5312 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 816 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3525 IncrementalHoareTripleChecker+Invalid, 4341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 816 mSolverCounterUnsat, 0 mSDtfsCounter, 3525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1006 GetRequests, 295 SyntacticMatches, 11 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19420 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6951occurred in iteration=15, InterpolantAutomatonStates: 457, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 570 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 2940 SizeOfPredicates, 125 NumberOfNonLiveVariables, 2085 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 38 InterpolantComputations, 7 PerfectInterpolantSequences, 805/2729 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 22:53:27,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...