/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/fib_safe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:38:30,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:38:30,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:38:30,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:38:30,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:38:30,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:38:30,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:38:30,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:38:30,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:38:30,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:38:30,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:38:30,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:38:30,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:38:30,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:38:30,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:38:30,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:38:30,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:38:30,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:38:30,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:38:30,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:38:30,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:38:30,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:38:30,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:38:30,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:38:30,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:38:30,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:38:30,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:38:30,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:38:30,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:38:30,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:38:30,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:38:30,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:38:30,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:38:30,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:38:30,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:38:30,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:38:30,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:38:30,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:38:30,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:38:30,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:38:30,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:38:30,598 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:38:30,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:38:30,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:38:30,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:38:30,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:38:30,628 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:38:30,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:38:30,628 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:38:30,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:38:30,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:38:30,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:38:30,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:38:30,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:38:30,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:38:30,629 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:38:30,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:38:30,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:30,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:38:30,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:38:30,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:38:30,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:38:30,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:38:30,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:38:30,631 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:38:31,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:38:31,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:38:31,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:38:31,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:38:31,064 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:38:31,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-5.i [2022-12-05 22:38:32,144 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:38:32,404 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:38:32,404 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i [2022-12-05 22:38:32,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51aa92c1a/d236b5d428734edfaf17140e5848cc28/FLAG41f154407 [2022-12-05 22:38:32,439 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51aa92c1a/d236b5d428734edfaf17140e5848cc28 [2022-12-05 22:38:32,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:38:32,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:38:32,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:38:32,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:38:32,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44223d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32, skipping insertion in model container [2022-12-05 22:38:32,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:38:32,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:38:32,766 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/fib_safe-5.i[30241,30254] [2022-12-05 22:38:32,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,802 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:38:32,820 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/fib_safe-5.i[30241,30254] [2022-12-05 22:38:32,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,851 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:38:32,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32 WrapperNode [2022-12-05 22:38:32,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:32,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:38:32,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:38:32,856 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:38:32" (1/1) ... [2022-12-05 22:38:32,865 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:38:32" (1/1) ... [2022-12-05 22:38:32,878 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-05 22:38:32,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:32,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:38:32,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:38:32,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:38:32,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:38:32,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:38:32,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:38:32,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:38:32,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:32,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:32,917 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:38:32,933 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:38:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:38:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:38:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:38:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:38:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:38:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:38:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:38:32,959 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:38:33,105 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:38:33,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:38:33,271 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:38:33,276 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:38:33,276 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 22:38:33,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:33 BoogieIcfgContainer [2022-12-05 22:38:33,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:38:33,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:38:33,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:38:33,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:38:33,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:38:32" (1/3) ... [2022-12-05 22:38:33,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e13fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:33, skipping insertion in model container [2022-12-05 22:38:33,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (2/3) ... [2022-12-05 22:38:33,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e13fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:33, skipping insertion in model container [2022-12-05 22:38:33,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:33" (3/3) ... [2022-12-05 22:38:33,285 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-5.i [2022-12-05 22:38:33,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:38:33,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:38:33,300 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:38:33,358 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:38:33,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,435 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 22:38:33,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:33,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,488 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,489 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 22:38:33,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-05 22:38:36,439 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-05 22:38:36,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:38:36,459 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;@73764191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:38:36,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:38:36,462 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-05 22:38:36,462 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:36,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,463 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:38:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-05 22:38:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:36,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051307962] [2022-12-05 22:38:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,605 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:38:36,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051307962] [2022-12-05 22:38:36,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051307962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:36,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:36,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:38:36,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748530835] [2022-12-05 22:38:36,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:36,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:36,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:36,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.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:38:36,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:36,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:36,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:36,673 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:36,673 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:38:36,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-05 22:38:36,675 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-05 22:38:36,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 22:38:36,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-05 22:38:36,683 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-05 22:38:36,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:36,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:36,686 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-05 22:38:36,689 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-05 22:38:36,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:36,690 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,691 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:36,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:36,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,695 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-05 22:38:36,695 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:36,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-05 22:38:36,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 22:38:36,695 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:36,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:38:36,697 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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:38:36,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:38:36,697 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:38:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-05 22:38:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900486823] [2022-12-05 22:38:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,751 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:38:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900486823] [2022-12-05 22:38:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900486823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416632035] [2022-12-05 22:38:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:36,755 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:38:36,795 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:38:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:36,847 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:38:36,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:36,856 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:38:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416632035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:36,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955775016] [2022-12-05 22:38:36,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:36,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:38:36,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:36,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:36,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:38:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:36,952 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:36,952 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:36,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:36,954 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:36,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:36,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-05 22:38:36,955 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:36,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:36,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:36,956 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:36,957 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:36,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:36,957 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,957 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:36,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:36,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,960 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:36,960 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:36,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:36,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:37,245 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:37,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-05 22:38:37,246 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:37,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,255 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:38:37,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,451 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:38:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-05 22:38:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873371740] [2022-12-05 22:38:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,494 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:38:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873371740] [2022-12-05 22:38:37,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873371740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626218822] [2022-12-05 22:38:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:37,496 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:38:37,498 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:38:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:37,554 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:38:37,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:37,562 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:38:37,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626218822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:37,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:37,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746628435] [2022-12-05 22:38:37,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:37,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:37,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:37,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:37,612 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:37,612 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:37,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-05 22:38:37,614 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:37,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:37,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:37,618 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:37,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:37,620 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:37,621 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:37,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:37,621 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,621 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:37,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:37,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,624 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:37,624 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:37,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:37,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:37,813 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:37,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-05 22:38:37,814 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:37,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,836 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:38:38,019 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,SelfDestructingSolverStorable2 [2022-12-05 22:38:38,020 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:38:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-05 22:38:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112890831] [2022-12-05 22:38:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,088 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:38:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112890831] [2022-12-05 22:38:38,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112890831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443360641] [2022-12-05 22:38:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,104 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:38:38,164 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:38:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,223 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:38:38,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,232 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:38:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443360641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891317744] [2022-12-05 22:38:38,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:38,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:38,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,288 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:38,289 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-05 22:38:38,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-05 22:38:38,293 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:38,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:38,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:38,297 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:38,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:38,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:38,301 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:38,303 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:38,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,305 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,307 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,311 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:38,311 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:38,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:38,456 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:38,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-05 22:38:38,459 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:38,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:38,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,664 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:38:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149196, now seen corresponding path program 1 times [2022-12-05 22:38:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124356700] [2022-12-05 22:38:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,722 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:38:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124356700] [2022-12-05 22:38:38,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124356700] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368437417] [2022-12-05 22:38:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,724 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:38:38,726 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:38:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,783 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:38:38,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,791 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:38:38,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368437417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290436450] [2022-12-05 22:38:38,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:38,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:38,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:38,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,841 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:38,841 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:38,842 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:38,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:38,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:38,843 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:38,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:38,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:38,844 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:38,845 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:38,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,845 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,845 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,847 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:38,847 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:38,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:38,966 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:38,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-05 22:38:38,967 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:38,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:39,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,172 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:38:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149134, now seen corresponding path program 1 times [2022-12-05 22:38:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017370789] [2022-12-05 22:38:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,237 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:38:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:39,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017370789] [2022-12-05 22:38:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017370789] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:39,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801797264] [2022-12-05 22:38:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:39,241 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:38:39,243 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:38:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:39,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:39,306 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:38:39,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:39,313 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:38:39,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801797264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:39,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:39,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-05 22:38:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544949841] [2022-12-05 22:38:39,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:38:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:38:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:38:39,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:39,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:38:39,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:39,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:39,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:39,343 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:39,343 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-05 22:38:39,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 149 events. 97/149 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 20 based on Foata normal form. 9/126 useless extension candidates. Maximal degree in co-relation 399. Up to 64 conditions per place. [2022-12-05 22:38:39,344 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-05 22:38:39,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-05 22:38:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-05 22:38:39,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 22:38:39,345 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-05 22:38:39,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-05 22:38:39,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:39,346 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-05 22:38:39,347 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-05 22:38:39,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:39,347 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,347 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:39,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:39,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,349 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-05 22:38:39,349 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:39,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 15 events. 3/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2022-12-05 22:38:39,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-05 22:38:39,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:38:39,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-05 22:38:39,431 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-05 22:38:39,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:38:39,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:39,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:39,448 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:38:39,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,632 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:38:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149103, now seen corresponding path program 1 times [2022-12-05 22:38:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466502832] [2022-12-05 22:38:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,806 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:38:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466502832] [2022-12-05 22:38:39,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466502832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680928765] [2022-12-05 22:38:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:39,808 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:38:39,810 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:38:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:38:39,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:39,905 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:38:39,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:40,063 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:38:40,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680928765] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:40,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:40,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-05 22:38:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459957064] [2022-12-05 22:38:40,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:40,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:38:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:38:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:38:40,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:40,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 50 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:40,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:40,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:40,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:40,285 INFO L130 PetriNetUnfolder]: 247/378 cut-off events. [2022-12-05 22:38:40,286 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-05 22:38:40,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 378 events. 247/378 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1183 event pairs, 31 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 973. Up to 167 conditions per place. [2022-12-05 22:38:40,287 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 45 selfloop transitions, 19 changer transitions 0/64 dead transitions. [2022-12-05 22:38:40,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 64 transitions, 318 flow [2022-12-05 22:38:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:38:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:38:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-05 22:38:40,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 22:38:40,288 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-05 22:38:40,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 64 transitions, 318 flow [2022-12-05 22:38:40,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 64 transitions, 288 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-05 22:38:40,289 INFO L231 Difference]: Finished difference. Result has 28 places, 33 transitions, 164 flow [2022-12-05 22:38:40,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=28, PETRI_TRANSITIONS=33} [2022-12-05 22:38:40,290 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-05 22:38:40,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:40,290 INFO L89 Accepts]: Start accepts. Operand has 28 places, 33 transitions, 164 flow [2022-12-05 22:38:40,290 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:40,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:40,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-05 22:38:40,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 33 transitions, 164 flow [2022-12-05 22:38:40,295 INFO L130 PetriNetUnfolder]: 35/77 cut-off events. [2022-12-05 22:38:40,295 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 22:38:40,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 77 events. 35/77 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 219 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 187. Up to 41 conditions per place. [2022-12-05 22:38:40,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-05 22:38:40,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-05 22:38:40,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:40,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:40,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:40,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:40,573 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:40,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-05 22:38:40,574 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 33 transitions, 186 flow [2022-12-05 22:38:40,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:40,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:40,574 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:40,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:40,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:40,775 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:38:40,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash 66809546, now seen corresponding path program 1 times [2022-12-05 22:38:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:40,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010791152] [2022-12-05 22:38:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:40,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010791152] [2022-12-05 22:38:40,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010791152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:40,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115268499] [2022-12-05 22:38:40,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:40,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:40,931 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:38:40,934 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:38:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:40,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:40,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:41,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:41,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115268499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:41,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:41,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538625175] [2022-12-05 22:38:41,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:41,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:41,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:38:41,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 33 transitions, 186 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:38:41,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:41,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:38:41,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:43,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:45,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:48,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:53,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:53,288 INFO L130 PetriNetUnfolder]: 637/971 cut-off events. [2022-12-05 22:38:53,289 INFO L131 PetriNetUnfolder]: For 1397/1397 co-relation queries the response was YES. [2022-12-05 22:38:53,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 971 events. 637/971 cut-off events. For 1397/1397 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4001 event pairs, 35 based on Foata normal form. 38/997 useless extension candidates. Maximal degree in co-relation 2976. Up to 370 conditions per place. [2022-12-05 22:38:53,294 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 89 selfloop transitions, 67 changer transitions 3/159 dead transitions. [2022-12-05 22:38:53,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 159 transitions, 986 flow [2022-12-05 22:38:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 22:38:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 22:38:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2022-12-05 22:38:53,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-05 22:38:53,295 INFO L175 Difference]: Start difference. First operand has 28 places, 33 transitions, 186 flow. Second operand 16 states and 144 transitions. [2022-12-05 22:38:53,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 159 transitions, 986 flow [2022-12-05 22:38:53,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 159 transitions, 952 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-05 22:38:53,299 INFO L231 Difference]: Finished difference. Result has 48 places, 84 transitions, 614 flow [2022-12-05 22:38:53,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=614, PETRI_PLACES=48, PETRI_TRANSITIONS=84} [2022-12-05 22:38:53,299 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-05 22:38:53,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:53,300 INFO L89 Accepts]: Start accepts. Operand has 48 places, 84 transitions, 614 flow [2022-12-05 22:38:53,300 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:53,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:53,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 84 transitions, 614 flow [2022-12-05 22:38:53,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 84 transitions, 614 flow [2022-12-05 22:38:53,310 INFO L130 PetriNetUnfolder]: 89/180 cut-off events. [2022-12-05 22:38:53,310 INFO L131 PetriNetUnfolder]: For 452/455 co-relation queries the response was YES. [2022-12-05 22:38:53,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 180 events. 89/180 cut-off events. For 452/455 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 711 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 628. Up to 119 conditions per place. [2022-12-05 22:38:53,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 84 transitions, 614 flow [2022-12-05 22:38:53,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-05 22:38:53,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= (+ 13 v_~x~0_146) v_~x~0_144) (= (+ (* 21 v_~prev~0_162) (* 34 v_~cur~0_133) (* 3 v_~next~0_82)) (* 5 v_~prev~0_160)) (< v_~x~0_146 0) (= v_~cur~0_131 v_~next~0_82) (= (* 5 v_~next~0_82) (+ (* 21 v_~cur~0_133) (* v_~prev~0_162 13) (* 8 v_~prev~0_160)))) InVars {~prev~0=v_~prev~0_162, ~cur~0=v_~cur~0_133, ~x~0=v_~x~0_146} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_160, ~cur~0=v_~cur~0_131, ~x~0=v_~x~0_144} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:53,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= (+ 13 v_~x~0_146) v_~x~0_144) (= (+ (* 21 v_~prev~0_162) (* 34 v_~cur~0_133) (* 3 v_~next~0_82)) (* 5 v_~prev~0_160)) (< v_~x~0_146 0) (= v_~cur~0_131 v_~next~0_82) (= (* 5 v_~next~0_82) (+ (* 21 v_~cur~0_133) (* v_~prev~0_162 13) (* 8 v_~prev~0_160)))) InVars {~prev~0=v_~prev~0_162, ~cur~0=v_~cur~0_133, ~x~0=v_~x~0_146} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_160, ~cur~0=v_~cur~0_131, ~x~0=v_~x~0_144} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:53,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [343] L705-6-->L687-5: Formula: (and (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (< v_~p~0_40 5) (= (* 2 v_~next~0_72) (+ (* 21 v_~prev~0_143) (* 3 v_~prev~0_142) (* 34 v_~cur~0_114))) (= (+ 12 v_~x~0_127) v_~x~0_126) (= v_~p~0_39 (+ v_~p~0_40 1)) (= v_~cur~0_113 v_~next~0_72) (= (+ (* 21 v_~cur~0_114) (* v_~prev~0_143 13) (* 3 v_~next~0_72)) (* 5 v_~prev~0_142)) (< v_~x~0_127 1)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_143, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_114, ~x~0=v_~x~0_127} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_77|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_72, ~prev~0=v_~prev~0_142, ~i~0=v_~i~0_103, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_113, ~x~0=v_~x~0_126} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:38:53,598 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:53,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-05 22:38:53,599 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 84 transitions, 632 flow [2022-12-05 22:38:53,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:38:53,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:53,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:53,604 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:38:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:53,800 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:38:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1106200438, now seen corresponding path program 1 times [2022-12-05 22:38:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581242662] [2022-12-05 22:38:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:53,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581242662] [2022-12-05 22:38:53,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581242662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:53,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515668507] [2022-12-05 22:38:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:53,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:53,829 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:38:53,830 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:38:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:53,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:53,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:53,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:38:53,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515668507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:53,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:38:53,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-05 22:38:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614211923] [2022-12-05 22:38:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:53,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:38:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:38:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:38:53,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:38:53,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 84 transitions, 632 flow. Second operand has 4 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:38:53,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:53,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:38:53,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:53,966 INFO L130 PetriNetUnfolder]: 344/561 cut-off events. [2022-12-05 22:38:53,966 INFO L131 PetriNetUnfolder]: For 1845/1845 co-relation queries the response was YES. [2022-12-05 22:38:53,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 561 events. 344/561 cut-off events. For 1845/1845 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2231 event pairs, 153 based on Foata normal form. 81/626 useless extension candidates. Maximal degree in co-relation 1877. Up to 337 conditions per place. [2022-12-05 22:38:53,968 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-05 22:38:53,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 492 flow [2022-12-05 22:38:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-05 22:38:53,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-05 22:38:53,969 INFO L175 Difference]: Start difference. First operand has 46 places, 84 transitions, 632 flow. Second operand 4 states and 32 transitions. [2022-12-05 22:38:53,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 492 flow [2022-12-05 22:38:53,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 431 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:53,974 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 309 flow [2022-12-05 22:38:53,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2022-12-05 22:38:53,975 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-05 22:38:53,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:53,975 INFO L89 Accepts]: Start accepts. Operand has 39 places, 47 transitions, 309 flow [2022-12-05 22:38:53,975 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:53,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:53,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 47 transitions, 309 flow [2022-12-05 22:38:53,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 309 flow [2022-12-05 22:38:53,982 INFO L130 PetriNetUnfolder]: 48/121 cut-off events. [2022-12-05 22:38:53,983 INFO L131 PetriNetUnfolder]: For 238/252 co-relation queries the response was YES. [2022-12-05 22:38:53,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 121 events. 48/121 cut-off events. For 238/252 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 318. Up to 34 conditions per place. [2022-12-05 22:38:53,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 309 flow [2022-12-05 22:38:53,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-05 22:38:54,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:38:54,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-05 22:38:54,062 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 315 flow [2022-12-05 22:38:54,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:38:54,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:54,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:54,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-05 22:38:54,267 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,SelfDestructingSolverStorable8 [2022-12-05 22:38:54,267 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:38:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1429433377, now seen corresponding path program 1 times [2022-12-05 22:38:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54972921] [2022-12-05 22:38:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:54,424 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:38:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:54,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54972921] [2022-12-05 22:38:54,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54972921] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:54,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403679849] [2022-12-05 22:38:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:54,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:54,440 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:38:54,486 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:38:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:54,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:54,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:54,577 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:38:54,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:54,758 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:38:54,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403679849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:54,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:54,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345417834] [2022-12-05 22:38:54,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:54,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:54,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:38:54,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 315 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:38:54,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:54,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:38:54,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:56,279 INFO L130 PetriNetUnfolder]: 402/671 cut-off events. [2022-12-05 22:38:56,279 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2022-12-05 22:38:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 671 events. 402/671 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2926 event pairs, 40 based on Foata normal form. 26/681 useless extension candidates. Maximal degree in co-relation 2027. Up to 383 conditions per place. [2022-12-05 22:38:56,281 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-05 22:38:56,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 101 transitions, 700 flow [2022-12-05 22:38:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:38:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:38:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-05 22:38:56,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-05 22:38:56,282 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 315 flow. Second operand 10 states and 74 transitions. [2022-12-05 22:38:56,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 101 transitions, 700 flow [2022-12-05 22:38:56,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 101 transitions, 683 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:56,286 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 581 flow [2022-12-05 22:38:56,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=581, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2022-12-05 22:38:56,287 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2022-12-05 22:38:56,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:56,287 INFO L89 Accepts]: Start accepts. Operand has 51 places, 68 transitions, 581 flow [2022-12-05 22:38:56,287 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:56,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:56,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-05 22:38:56,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 68 transitions, 581 flow [2022-12-05 22:38:56,296 INFO L130 PetriNetUnfolder]: 63/155 cut-off events. [2022-12-05 22:38:56,296 INFO L131 PetriNetUnfolder]: For 402/436 co-relation queries the response was YES. [2022-12-05 22:38:56,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 155 events. 63/155 cut-off events. For 402/436 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 664 event pairs, 1 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 548. Up to 48 conditions per place. [2022-12-05 22:38:56,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-05 22:38:56,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-05 22:38:56,446 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:56,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-05 22:38:56,447 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 598 flow [2022-12-05 22:38:56,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:38:56,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:56,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:56,453 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:38:56,647 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,SelfDestructingSolverStorable9 [2022-12-05 22:38:56,648 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:38:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash 67781458, now seen corresponding path program 1 times [2022-12-05 22:38:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:56,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223842190] [2022-12-05 22:38:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:56,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:56,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223842190] [2022-12-05 22:38:56,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223842190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:56,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330791209] [2022-12-05 22:38:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:56,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:56,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:56,780 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:38:56,815 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:38:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:56,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:56,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:56,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:57,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330791209] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:57,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802532797] [2022-12-05 22:38:57,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:57,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:57,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:57,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:57,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 598 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:38:57,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:57,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:57,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:58,484 INFO L130 PetriNetUnfolder]: 548/935 cut-off events. [2022-12-05 22:38:58,484 INFO L131 PetriNetUnfolder]: For 3109/3109 co-relation queries the response was YES. [2022-12-05 22:38:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 935 events. 548/935 cut-off events. For 3109/3109 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4523 event pairs, 31 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 3268. Up to 295 conditions per place. [2022-12-05 22:38:58,488 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 73 selfloop transitions, 97 changer transitions 0/170 dead transitions. [2022-12-05 22:38:58,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 170 transitions, 1411 flow [2022-12-05 22:38:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:38:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:38:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-05 22:38:58,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33229813664596275 [2022-12-05 22:38:58,490 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 598 flow. Second operand 14 states and 107 transitions. [2022-12-05 22:38:58,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 170 transitions, 1411 flow [2022-12-05 22:38:58,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 170 transitions, 1374 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:58,502 INFO L231 Difference]: Finished difference. Result has 69 places, 120 transitions, 1241 flow [2022-12-05 22:38:58,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1241, PETRI_PLACES=69, PETRI_TRANSITIONS=120} [2022-12-05 22:38:58,502 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 51 predicate places. [2022-12-05 22:38:58,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:58,502 INFO L89 Accepts]: Start accepts. Operand has 69 places, 120 transitions, 1241 flow [2022-12-05 22:38:58,503 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:58,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:58,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-05 22:38:58,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 120 transitions, 1241 flow [2022-12-05 22:38:58,515 INFO L130 PetriNetUnfolder]: 81/205 cut-off events. [2022-12-05 22:38:58,515 INFO L131 PetriNetUnfolder]: For 778/810 co-relation queries the response was YES. [2022-12-05 22:38:58,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 205 events. 81/205 cut-off events. For 778/810 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1005 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 895. Up to 86 conditions per place. [2022-12-05 22:38:58,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-05 22:38:58,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-05 22:38:58,517 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:58,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 22:38:58,518 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 120 transitions, 1241 flow [2022-12-05 22:38:58,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:38:58,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:58,518 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:58,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-05 22:38:58,728 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,SelfDestructingSolverStorable10 [2022-12-05 22:38:58,729 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:38:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1362434503, now seen corresponding path program 1 times [2022-12-05 22:38:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725156624] [2022-12-05 22:38:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725156624] [2022-12-05 22:38:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725156624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387182036] [2022-12-05 22:38:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:58,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:58,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:58,853 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:38:58,879 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:38:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:58,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:38:58,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:59,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:59,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387182036] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:59,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:59,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724867877] [2022-12-05 22:38:59,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:59,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:59,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:59,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:59,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:59,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 120 transitions, 1241 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:38:59,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:59,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:59,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:01,623 INFO L130 PetriNetUnfolder]: 592/1023 cut-off events. [2022-12-05 22:39:01,623 INFO L131 PetriNetUnfolder]: For 5408/5408 co-relation queries the response was YES. [2022-12-05 22:39:01,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1023 events. 592/1023 cut-off events. For 5408/5408 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5166 event pairs, 67 based on Foata normal form. 24/1028 useless extension candidates. Maximal degree in co-relation 4181. Up to 656 conditions per place. [2022-12-05 22:39:01,628 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 113 selfloop transitions, 61 changer transitions 0/174 dead transitions. [2022-12-05 22:39:01,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1819 flow [2022-12-05 22:39:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:39:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:39:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-05 22:39:01,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-05 22:39:01,629 INFO L175 Difference]: Start difference. First operand has 69 places, 120 transitions, 1241 flow. Second operand 11 states and 82 transitions. [2022-12-05 22:39:01,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1819 flow [2022-12-05 22:39:01,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1737 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:01,643 INFO L231 Difference]: Finished difference. Result has 80 places, 138 transitions, 1515 flow [2022-12-05 22:39:01,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1515, PETRI_PLACES=80, PETRI_TRANSITIONS=138} [2022-12-05 22:39:01,643 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 62 predicate places. [2022-12-05 22:39:01,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:01,643 INFO L89 Accepts]: Start accepts. Operand has 80 places, 138 transitions, 1515 flow [2022-12-05 22:39:01,644 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:01,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:01,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-05 22:39:01,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 138 transitions, 1515 flow [2022-12-05 22:39:01,658 INFO L130 PetriNetUnfolder]: 92/237 cut-off events. [2022-12-05 22:39:01,658 INFO L131 PetriNetUnfolder]: For 987/1019 co-relation queries the response was YES. [2022-12-05 22:39:01,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 237 events. 92/237 cut-off events. For 987/1019 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1222 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 1104. Up to 106 conditions per place. [2022-12-05 22:39:01,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-05 22:39:01,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-05 22:39:01,728 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:01,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-05 22:39:01,729 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 138 transitions, 1526 flow [2022-12-05 22:39:01,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:39:01,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:01,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:01,742 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:39:01,929 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,SelfDestructingSolverStorable11 [2022-12-05 22:39:01,930 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:39:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash 548598122, now seen corresponding path program 1 times [2022-12-05 22:39:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:01,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918626370] [2022-12-05 22:39:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:02,026 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:39:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:02,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918626370] [2022-12-05 22:39:02,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918626370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:02,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600606360] [2022-12-05 22:39:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:02,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:02,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:02,041 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-05 22:39:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:02,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:02,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:02,198 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:39:02,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:02,423 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:39:02,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600606360] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:02,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:02,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209649791] [2022-12-05 22:39:02,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:02,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:02,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 22:39:02,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 138 transitions, 1526 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:02,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:02,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 22:39:02,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:05,532 INFO L130 PetriNetUnfolder]: 706/1215 cut-off events. [2022-12-05 22:39:05,532 INFO L131 PetriNetUnfolder]: For 6324/6324 co-relation queries the response was YES. [2022-12-05 22:39:05,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1215 events. 706/1215 cut-off events. For 6324/6324 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6422 event pairs, 43 based on Foata normal form. 14/1210 useless extension candidates. Maximal degree in co-relation 5194. Up to 676 conditions per place. [2022-12-05 22:39:05,538 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 128 selfloop transitions, 96 changer transitions 2/226 dead transitions. [2022-12-05 22:39:05,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 226 transitions, 2420 flow [2022-12-05 22:39:05,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-12-05 22:39:05,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-05 22:39:05,539 INFO L175 Difference]: Start difference. First operand has 80 places, 138 transitions, 1526 flow. Second operand 18 states and 117 transitions. [2022-12-05 22:39:05,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 226 transitions, 2420 flow [2022-12-05 22:39:05,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 2358 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:05,557 INFO L231 Difference]: Finished difference. Result has 99 places, 170 transitions, 2118 flow [2022-12-05 22:39:05,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2118, PETRI_PLACES=99, PETRI_TRANSITIONS=170} [2022-12-05 22:39:05,558 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 81 predicate places. [2022-12-05 22:39:05,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:05,558 INFO L89 Accepts]: Start accepts. Operand has 99 places, 170 transitions, 2118 flow [2022-12-05 22:39:05,559 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:05,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:05,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-05 22:39:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 170 transitions, 2118 flow [2022-12-05 22:39:05,576 INFO L130 PetriNetUnfolder]: 109/282 cut-off events. [2022-12-05 22:39:05,577 INFO L131 PetriNetUnfolder]: For 1388/1420 co-relation queries the response was YES. [2022-12-05 22:39:05,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 282 events. 109/282 cut-off events. For 1388/1420 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1590 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 1480. Up to 125 conditions per place. [2022-12-05 22:39:05,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-05 22:39:05,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-05 22:39:05,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [360] L705-6-->L695-5: Formula: (and (< v_~x~0_197 1) (< v_~q~0_107 6) (= (+ (* 3 v_~prev~0_210) (* 34 v_~cur~0_177) (* 21 v_~prev~0_211)) (* 2 v_~next~0_109)) (= (+ 12 v_~x~0_197) v_~x~0_196) (= (+ 2 v_~q~0_109) v_~q~0_107) (= v_~next~0_109 v_~cur~0_176) (= v_~j~0_185 (+ v_~j~0_187 (* 2 v_~i~0_163))) (= (* 5 v_~prev~0_210) (+ (* 3 v_~next~0_109) (* v_~prev~0_211 13) (* 21 v_~cur~0_177)))) InVars {~j~0=v_~j~0_187, ~prev~0=v_~prev~0_211, ~i~0=v_~i~0_163, ~q~0=v_~q~0_109, ~cur~0=v_~cur~0_177, ~x~0=v_~x~0_197} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_119|, ~j~0=v_~j~0_185, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_210, ~i~0=v_~i~0_163, ~q~0=v_~q~0_107, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_76|, ~cur~0=v_~cur~0_176, ~x~0=v_~x~0_196} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:39:05,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [342] L705-6-->L695-5: Formula: (and (= (+ (* v_~prev~0_139 13) (* 21 v_~cur~0_110) (* 3 v_~next~0_70)) (* 5 v_~prev~0_138)) (< v_~q~0_56 5) (= (+ (* 34 v_~cur~0_110) (* 3 v_~prev~0_138) (* 21 v_~prev~0_139)) (* 2 v_~next~0_70)) (< v_~x~0_123 1) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= (+ 12 v_~x~0_123) v_~x~0_122) (= v_~q~0_55 (+ v_~q~0_56 1)) (= v_~cur~0_109 v_~next~0_70)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_139, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_110, ~x~0=v_~x~0_123} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_75|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_70, ~prev~0=v_~prev~0_138, ~i~0=v_~i~0_101, ~q~0=v_~q~0_55, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_109, ~x~0=v_~x~0_122} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:39:06,165 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:39:06,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 608 [2022-12-05 22:39:06,166 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 170 transitions, 2154 flow [2022-12-05 22:39:06,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:06,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:06,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:06,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-05 22:39:06,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-05 22:39:06,367 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:39:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1362284370, now seen corresponding path program 1 times [2022-12-05 22:39:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303644237] [2022-12-05 22:39:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303644237] [2022-12-05 22:39:06,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303644237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:06,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665752861] [2022-12-05 22:39:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:06,529 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:06,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-05 22:39:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:06,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:39:06,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:06,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665752861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:06,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:06,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442004718] [2022-12-05 22:39:06,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:06,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 22:39:06,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 170 transitions, 2154 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:39:06,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:06,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 22:39:06,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:08,465 INFO L130 PetriNetUnfolder]: 874/1499 cut-off events. [2022-12-05 22:39:08,466 INFO L131 PetriNetUnfolder]: For 12562/12562 co-relation queries the response was YES. [2022-12-05 22:39:08,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1499 events. 874/1499 cut-off events. For 12562/12562 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8364 event pairs, 44 based on Foata normal form. 22/1502 useless extension candidates. Maximal degree in co-relation 7150. Up to 501 conditions per place. [2022-12-05 22:39:08,474 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 103 selfloop transitions, 152 changer transitions 0/255 dead transitions. [2022-12-05 22:39:08,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 255 transitions, 3262 flow [2022-12-05 22:39:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:39:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:39:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-12-05 22:39:08,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-05 22:39:08,476 INFO L175 Difference]: Start difference. First operand has 99 places, 170 transitions, 2154 flow. Second operand 12 states and 107 transitions. [2022-12-05 22:39:08,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 255 transitions, 3262 flow [2022-12-05 22:39:08,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 255 transitions, 3132 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-12-05 22:39:08,512 INFO L231 Difference]: Finished difference. Result has 107 places, 206 transitions, 2974 flow [2022-12-05 22:39:08,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2974, PETRI_PLACES=107, PETRI_TRANSITIONS=206} [2022-12-05 22:39:08,512 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 89 predicate places. [2022-12-05 22:39:08,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:08,512 INFO L89 Accepts]: Start accepts. Operand has 107 places, 206 transitions, 2974 flow [2022-12-05 22:39:08,513 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:08,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:08,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-05 22:39:08,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 206 transitions, 2974 flow [2022-12-05 22:39:08,536 INFO L130 PetriNetUnfolder]: 137/352 cut-off events. [2022-12-05 22:39:08,536 INFO L131 PetriNetUnfolder]: For 2672/2722 co-relation queries the response was YES. [2022-12-05 22:39:08,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 352 events. 137/352 cut-off events. For 2672/2722 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2145 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 2176. Up to 169 conditions per place. [2022-12-05 22:39:08,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-05 22:39:08,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-05 22:39:08,580 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:08,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-05 22:39:08,581 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 206 transitions, 2978 flow [2022-12-05 22:39:08,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:39:08,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:08,582 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:08,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-05 22:39:08,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-05 22:39:08,787 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:39:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1362255757, now seen corresponding path program 1 times [2022-12-05 22:39:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:08,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712084813] [2022-12-05 22:39:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:08,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712084813] [2022-12-05 22:39:08,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712084813] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:08,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021678390] [2022-12-05 22:39:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:08,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:08,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:08,904 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:08,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-05 22:39:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:08,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:08,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:09,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:09,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021678390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:09,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:09,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133084173] [2022-12-05 22:39:09,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:09,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:09,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:09,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:09,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 22:39:09,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 206 transitions, 2978 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:39:09,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:09,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 22:39:09,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:09,972 INFO L130 PetriNetUnfolder]: 914/1579 cut-off events. [2022-12-05 22:39:09,972 INFO L131 PetriNetUnfolder]: For 20188/20188 co-relation queries the response was YES. [2022-12-05 22:39:09,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 1579 events. 914/1579 cut-off events. For 20188/20188 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8888 event pairs, 104 based on Foata normal form. 32/1586 useless extension candidates. Maximal degree in co-relation 8328. Up to 1020 conditions per place. [2022-12-05 22:39:09,983 INFO L137 encePairwiseOnDemand]: 8/31 looper letters, 155 selfloop transitions, 108 changer transitions 2/265 dead transitions. [2022-12-05 22:39:09,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 265 transitions, 3844 flow [2022-12-05 22:39:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:39:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:39:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-05 22:39:09,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2456575682382134 [2022-12-05 22:39:09,984 INFO L175 Difference]: Start difference. First operand has 107 places, 206 transitions, 2978 flow. Second operand 13 states and 99 transitions. [2022-12-05 22:39:09,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 265 transitions, 3844 flow [2022-12-05 22:39:10,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 265 transitions, 3743 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-05 22:39:10,036 INFO L231 Difference]: Finished difference. Result has 118 places, 222 transitions, 3473 flow [2022-12-05 22:39:10,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3473, PETRI_PLACES=118, PETRI_TRANSITIONS=222} [2022-12-05 22:39:10,037 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 100 predicate places. [2022-12-05 22:39:10,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:10,037 INFO L89 Accepts]: Start accepts. Operand has 118 places, 222 transitions, 3473 flow [2022-12-05 22:39:10,038 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:10,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:10,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-05 22:39:10,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 222 transitions, 3473 flow [2022-12-05 22:39:10,064 INFO L130 PetriNetUnfolder]: 147/382 cut-off events. [2022-12-05 22:39:10,064 INFO L131 PetriNetUnfolder]: For 3263/3327 co-relation queries the response was YES. [2022-12-05 22:39:10,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 382 events. 147/382 cut-off events. For 3263/3327 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2324 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 2522. Up to 183 conditions per place. [2022-12-05 22:39:10,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-05 22:39:10,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-05 22:39:10,135 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:10,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-05 22:39:10,136 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 222 transitions, 3485 flow [2022-12-05 22:39:10,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:39:10,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:10,137 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:10,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:10,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:10,341 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:39:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 549150697, now seen corresponding path program 1 times [2022-12-05 22:39:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:10,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145330827] [2022-12-05 22:39:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:10,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145330827] [2022-12-05 22:39:10,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145330827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:10,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719818769] [2022-12-05 22:39:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:10,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:10,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:10,486 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:10,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-05 22:39:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:10,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:10,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:10,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:10,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719818769] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:10,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:10,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:10,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304915068] [2022-12-05 22:39:10,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:10,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:10,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:10,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:10,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 22:39:10,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 222 transitions, 3485 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:10,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:10,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 22:39:10,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:21,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:22,272 INFO L130 PetriNetUnfolder]: 1032/1791 cut-off events. [2022-12-05 22:39:22,272 INFO L131 PetriNetUnfolder]: For 20832/20832 co-relation queries the response was YES. [2022-12-05 22:39:22,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 1791 events. 1032/1791 cut-off events. For 20832/20832 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10474 event pairs, 90 based on Foata normal form. 20/1786 useless extension candidates. Maximal degree in co-relation 9859. Up to 1048 conditions per place. [2022-12-05 22:39:22,283 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 167 selfloop transitions, 150 changer transitions 3/320 dead transitions. [2022-12-05 22:39:22,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 320 transitions, 4900 flow [2022-12-05 22:39:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 22:39:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 22:39:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-05 22:39:22,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22348484848484848 [2022-12-05 22:39:22,284 INFO L175 Difference]: Start difference. First operand has 118 places, 222 transitions, 3485 flow. Second operand 16 states and 118 transitions. [2022-12-05 22:39:22,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 320 transitions, 4900 flow [2022-12-05 22:39:22,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 320 transitions, 4802 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-05 22:39:22,353 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 4573 flow [2022-12-05 22:39:22,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4573, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2022-12-05 22:39:22,354 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 115 predicate places. [2022-12-05 22:39:22,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:22,354 INFO L89 Accepts]: Start accepts. Operand has 133 places, 265 transitions, 4573 flow [2022-12-05 22:39:22,355 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:22,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:22,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-05 22:39:22,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 265 transitions, 4573 flow [2022-12-05 22:39:22,388 INFO L130 PetriNetUnfolder]: 168/439 cut-off events. [2022-12-05 22:39:22,388 INFO L131 PetriNetUnfolder]: For 3951/4009 co-relation queries the response was YES. [2022-12-05 22:39:22,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 439 events. 168/439 cut-off events. For 3951/4009 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2832 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 3126. Up to 210 conditions per place. [2022-12-05 22:39:22,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-05 22:39:22,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-05 22:39:22,393 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:22,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-05 22:39:22,394 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 4573 flow [2022-12-05 22:39:22,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:22,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:22,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:22,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-05 22:39:22,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-05 22:39:22,598 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:39:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash 550394634, now seen corresponding path program 1 times [2022-12-05 22:39:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441321213] [2022-12-05 22:39:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:22,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:22,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441321213] [2022-12-05 22:39:22,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441321213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:22,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:39:22,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:39:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22158000] [2022-12-05 22:39:22,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:22,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:39:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:22,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:39:22,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:39:22,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 22:39:22,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 4573 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:22,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:22,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 22:39:22,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:22,814 INFO L130 PetriNetUnfolder]: 964/1675 cut-off events. [2022-12-05 22:39:22,814 INFO L131 PetriNetUnfolder]: For 18214/18214 co-relation queries the response was YES. [2022-12-05 22:39:22,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10246 conditions, 1675 events. 964/1675 cut-off events. For 18214/18214 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 9638 event pairs, 288 based on Foata normal form. 65/1726 useless extension candidates. Maximal degree in co-relation 10192. Up to 1370 conditions per place. [2022-12-05 22:39:22,828 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 241 selfloop transitions, 32 changer transitions 0/273 dead transitions. [2022-12-05 22:39:22,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 273 transitions, 5189 flow [2022-12-05 22:39:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:39:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:39:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 22:39:22,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2022-12-05 22:39:22,830 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 4573 flow. Second operand 3 states and 41 transitions. [2022-12-05 22:39:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 273 transitions, 5189 flow [2022-12-05 22:39:22,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 273 transitions, 5048 flow, removed 44 selfloop flow, removed 8 redundant places. [2022-12-05 22:39:22,901 INFO L231 Difference]: Finished difference. Result has 128 places, 264 transitions, 4488 flow [2022-12-05 22:39:22,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4332, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4488, PETRI_PLACES=128, PETRI_TRANSITIONS=264} [2022-12-05 22:39:22,901 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 110 predicate places. [2022-12-05 22:39:22,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:22,901 INFO L89 Accepts]: Start accepts. Operand has 128 places, 264 transitions, 4488 flow [2022-12-05 22:39:22,902 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:22,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:22,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 264 transitions, 4488 flow [2022-12-05 22:39:22,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 264 transitions, 4488 flow [2022-12-05 22:39:22,934 INFO L130 PetriNetUnfolder]: 163/425 cut-off events. [2022-12-05 22:39:22,934 INFO L131 PetriNetUnfolder]: For 3718/3779 co-relation queries the response was YES. [2022-12-05 22:39:22,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 425 events. 163/425 cut-off events. For 3718/3779 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2727 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 3076. Up to 199 conditions per place. [2022-12-05 22:39:22,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 264 transitions, 4488 flow [2022-12-05 22:39:22,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 798 [2022-12-05 22:39:22,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:22,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-05 22:39:22,973 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 264 transitions, 4489 flow [2022-12-05 22:39:22,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:22,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:22,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:22,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 22:39:22,973 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 720763637, now seen corresponding path program 1 times [2022-12-05 22:39:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:22,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736916121] [2022-12-05 22:39:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736916121] [2022-12-05 22:39:23,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736916121] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263143625] [2022-12-05 22:39:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:23,092 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:23,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-05 22:39:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:23,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:23,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:23,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:23,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263143625] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:23,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:23,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958907302] [2022-12-05 22:39:23,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:23,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:23,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 22:39:23,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 264 transitions, 4489 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:23,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:23,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 22:39:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:26,199 INFO L130 PetriNetUnfolder]: 1254/2181 cut-off events. [2022-12-05 22:39:26,200 INFO L131 PetriNetUnfolder]: For 40523/40523 co-relation queries the response was YES. [2022-12-05 22:39:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13742 conditions, 2181 events. 1254/2181 cut-off events. For 40523/40523 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 13135 event pairs, 80 based on Foata normal form. 60/2227 useless extension candidates. Maximal degree in co-relation 13688. Up to 930 conditions per place. [2022-12-05 22:39:26,252 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 171 selfloop transitions, 240 changer transitions 0/411 dead transitions. [2022-12-05 22:39:26,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 411 transitions, 7034 flow [2022-12-05 22:39:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 140 transitions. [2022-12-05 22:39:26,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2356902356902357 [2022-12-05 22:39:26,254 INFO L175 Difference]: Start difference. First operand has 128 places, 264 transitions, 4489 flow. Second operand 18 states and 140 transitions. [2022-12-05 22:39:26,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 411 transitions, 7034 flow [2022-12-05 22:39:26,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 411 transitions, 6998 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:26,352 INFO L231 Difference]: Finished difference. Result has 153 places, 348 transitions, 6740 flow [2022-12-05 22:39:26,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4453, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6740, PETRI_PLACES=153, PETRI_TRANSITIONS=348} [2022-12-05 22:39:26,353 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 135 predicate places. [2022-12-05 22:39:26,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:26,353 INFO L89 Accepts]: Start accepts. Operand has 153 places, 348 transitions, 6740 flow [2022-12-05 22:39:26,355 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:26,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:26,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 348 transitions, 6740 flow [2022-12-05 22:39:26,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 348 transitions, 6740 flow [2022-12-05 22:39:26,405 INFO L130 PetriNetUnfolder]: 208/540 cut-off events. [2022-12-05 22:39:26,405 INFO L131 PetriNetUnfolder]: For 7144/7242 co-relation queries the response was YES. [2022-12-05 22:39:26,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 540 events. 208/540 cut-off events. For 7144/7242 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3572 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 4449. Up to 280 conditions per place. [2022-12-05 22:39:26,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 348 transitions, 6740 flow [2022-12-05 22:39:26,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-05 22:39:26,415 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:26,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-05 22:39:26,418 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 348 transitions, 6740 flow [2022-12-05 22:39:26,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:26,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:26,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:26,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:26,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-05 22:39:26,622 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -127758220, now seen corresponding path program 1 times [2022-12-05 22:39:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:26,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15220952] [2022-12-05 22:39:26,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:26,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15220952] [2022-12-05 22:39:26,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15220952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:26,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24506969] [2022-12-05 22:39:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:26,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:26,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:26,757 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:26,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-05 22:39:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:26,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:26,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:26,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:27,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24506969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:27,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:27,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340306375] [2022-12-05 22:39:27,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:27,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:27,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:27,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 22:39:27,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 348 transitions, 6740 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:39:27,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:27,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 22:39:27,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:30,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:30,990 INFO L130 PetriNetUnfolder]: 1500/2609 cut-off events. [2022-12-05 22:39:30,990 INFO L131 PetriNetUnfolder]: For 54315/54315 co-relation queries the response was YES. [2022-12-05 22:39:30,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 2609 events. 1500/2609 cut-off events. For 54315/54315 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 16286 event pairs, 143 based on Foata normal form. 32/2627 useless extension candidates. Maximal degree in co-relation 17794. Up to 1381 conditions per place. [2022-12-05 22:39:31,005 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 236 selfloop transitions, 252 changer transitions 0/488 dead transitions. [2022-12-05 22:39:31,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 488 transitions, 9182 flow [2022-12-05 22:39:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:39:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:39:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 152 transitions. [2022-12-05 22:39:31,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21933621933621933 [2022-12-05 22:39:31,007 INFO L175 Difference]: Start difference. First operand has 153 places, 348 transitions, 6740 flow. Second operand 21 states and 152 transitions. [2022-12-05 22:39:31,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 488 transitions, 9182 flow [2022-12-05 22:39:31,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 488 transitions, 8861 flow, removed 144 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:31,167 INFO L231 Difference]: Finished difference. Result has 178 places, 418 transitions, 8415 flow [2022-12-05 22:39:31,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6427, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8415, PETRI_PLACES=178, PETRI_TRANSITIONS=418} [2022-12-05 22:39:31,167 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 160 predicate places. [2022-12-05 22:39:31,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:31,168 INFO L89 Accepts]: Start accepts. Operand has 178 places, 418 transitions, 8415 flow [2022-12-05 22:39:31,169 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:31,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:31,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 418 transitions, 8415 flow [2022-12-05 22:39:31,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 418 transitions, 8415 flow [2022-12-05 22:39:31,230 INFO L130 PetriNetUnfolder]: 251/648 cut-off events. [2022-12-05 22:39:31,230 INFO L131 PetriNetUnfolder]: For 10893/11031 co-relation queries the response was YES. [2022-12-05 22:39:31,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 648 events. 251/648 cut-off events. For 10893/11031 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 4582 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 5544. Up to 336 conditions per place. [2022-12-05 22:39:31,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 418 transitions, 8415 flow [2022-12-05 22:39:31,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-05 22:39:31,304 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:31,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-05 22:39:31,305 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 418 transitions, 8435 flow [2022-12-05 22:39:31,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:39:31,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:31,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:31,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:31,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:31,509 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2102149420, now seen corresponding path program 1 times [2022-12-05 22:39:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:31,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783144530] [2022-12-05 22:39:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:31,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:31,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783144530] [2022-12-05 22:39:31,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783144530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:31,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257657011] [2022-12-05 22:39:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:31,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:31,536 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-05 22:39:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:31,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:39:31,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:31,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:31,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257657011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:31,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:31,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:39:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094904614] [2022-12-05 22:39:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:31,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:39:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:31,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:39:31,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:39:31,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:31,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 418 transitions, 8435 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:31,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:31,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:31,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:31,995 INFO L130 PetriNetUnfolder]: 1526/2637 cut-off events. [2022-12-05 22:39:31,995 INFO L131 PetriNetUnfolder]: For 57908/57908 co-relation queries the response was YES. [2022-12-05 22:39:32,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19174 conditions, 2637 events. 1526/2637 cut-off events. For 57908/57908 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 17188 event pairs, 301 based on Foata normal form. 18/2641 useless extension candidates. Maximal degree in co-relation 19101. Up to 1208 conditions per place. [2022-12-05 22:39:32,014 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 658 selfloop transitions, 5 changer transitions 10/673 dead transitions. [2022-12-05 22:39:32,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 673 transitions, 14917 flow [2022-12-05 22:39:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:39:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:39:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-05 22:39:32,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38857142857142857 [2022-12-05 22:39:32,015 INFO L175 Difference]: Start difference. First operand has 178 places, 418 transitions, 8435 flow. Second operand 5 states and 68 transitions. [2022-12-05 22:39:32,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 673 transitions, 14917 flow [2022-12-05 22:39:32,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 673 transitions, 14543 flow, removed 148 selfloop flow, removed 5 redundant places. [2022-12-05 22:39:32,238 INFO L231 Difference]: Finished difference. Result has 178 places, 415 transitions, 8131 flow [2022-12-05 22:39:32,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8108, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8131, PETRI_PLACES=178, PETRI_TRANSITIONS=415} [2022-12-05 22:39:32,239 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 160 predicate places. [2022-12-05 22:39:32,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:32,239 INFO L89 Accepts]: Start accepts. Operand has 178 places, 415 transitions, 8131 flow [2022-12-05 22:39:32,240 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:32,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:32,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 415 transitions, 8131 flow [2022-12-05 22:39:32,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 415 transitions, 8131 flow [2022-12-05 22:39:32,306 INFO L130 PetriNetUnfolder]: 263/679 cut-off events. [2022-12-05 22:39:32,306 INFO L131 PetriNetUnfolder]: For 12287/12404 co-relation queries the response was YES. [2022-12-05 22:39:32,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5924 conditions, 679 events. 263/679 cut-off events. For 12287/12404 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4821 event pairs, 0 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 5853. Up to 356 conditions per place. [2022-12-05 22:39:32,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 415 transitions, 8131 flow [2022-12-05 22:39:32,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 1248 [2022-12-05 22:39:32,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:32,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-05 22:39:32,351 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 415 transitions, 8126 flow [2022-12-05 22:39:32,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:32,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:32,351 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:32,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:32,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:32,556 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2100271967, now seen corresponding path program 1 times [2022-12-05 22:39:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:32,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032019374] [2022-12-05 22:39:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:32,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032019374] [2022-12-05 22:39:32,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032019374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:32,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488610008] [2022-12-05 22:39:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:32,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:32,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:32,587 INFO L229 MonitoredProcess]: Starting monitored process 20 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:39:32,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-05 22:39:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:32,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:39:32,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:32,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:32,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488610008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:32,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:32,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:39:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813850050] [2022-12-05 22:39:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:32,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:39:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:32,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:39:32,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:39:32,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:32,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 415 transitions, 8126 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:32,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:32,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:32,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:33,105 INFO L130 PetriNetUnfolder]: 1642/2803 cut-off events. [2022-12-05 22:39:33,106 INFO L131 PetriNetUnfolder]: For 63054/63054 co-relation queries the response was YES. [2022-12-05 22:39:33,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20731 conditions, 2803 events. 1642/2803 cut-off events. For 63054/63054 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 17954 event pairs, 295 based on Foata normal form. 6/2801 useless extension candidates. Maximal degree in co-relation 20657. Up to 1274 conditions per place. [2022-12-05 22:39:33,141 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 664 selfloop transitions, 15 changer transitions 10/689 dead transitions. [2022-12-05 22:39:33,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 689 transitions, 14823 flow [2022-12-05 22:39:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:39:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:39:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-05 22:39:33,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-05 22:39:33,142 INFO L175 Difference]: Start difference. First operand has 178 places, 415 transitions, 8126 flow. Second operand 6 states and 74 transitions. [2022-12-05 22:39:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 689 transitions, 14823 flow [2022-12-05 22:39:33,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 689 transitions, 14820 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:33,339 INFO L231 Difference]: Finished difference. Result has 184 places, 420 transitions, 8227 flow [2022-12-05 22:39:33,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8123, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8227, PETRI_PLACES=184, PETRI_TRANSITIONS=420} [2022-12-05 22:39:33,340 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 166 predicate places. [2022-12-05 22:39:33,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:33,340 INFO L89 Accepts]: Start accepts. Operand has 184 places, 420 transitions, 8227 flow [2022-12-05 22:39:33,341 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:33,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:33,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 420 transitions, 8227 flow [2022-12-05 22:39:33,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 420 transitions, 8227 flow [2022-12-05 22:39:33,421 INFO L130 PetriNetUnfolder]: 286/733 cut-off events. [2022-12-05 22:39:33,421 INFO L131 PetriNetUnfolder]: For 15291/15417 co-relation queries the response was YES. [2022-12-05 22:39:33,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 733 events. 286/733 cut-off events. For 15291/15417 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 5305 event pairs, 0 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 6487. Up to 391 conditions per place. [2022-12-05 22:39:33,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 420 transitions, 8227 flow [2022-12-05 22:39:33,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-05 22:39:33,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:33,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-05 22:39:33,527 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 420 transitions, 8261 flow [2022-12-05 22:39:33,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:33,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:33,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:33,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:33,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:33,727 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash 550646633, now seen corresponding path program 1 times [2022-12-05 22:39:33,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:33,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545827573] [2022-12-05 22:39:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:33,815 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:39:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545827573] [2022-12-05 22:39:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545827573] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951449790] [2022-12-05 22:39:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:33,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:33,827 INFO L229 MonitoredProcess]: Starting monitored process 21 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:39:33,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-05 22:39:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:33,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:39:33,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:33,981 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:39:33,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:34,221 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:39:34,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951449790] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:34,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:34,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115987547] [2022-12-05 22:39:34,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:34,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:34,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:34,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:34,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 420 transitions, 8261 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:34,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:34,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:34,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:35,673 INFO L130 PetriNetUnfolder]: 1968/3345 cut-off events. [2022-12-05 22:39:35,674 INFO L131 PetriNetUnfolder]: For 100742/100742 co-relation queries the response was YES. [2022-12-05 22:39:35,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26170 conditions, 3345 events. 1968/3345 cut-off events. For 100742/100742 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 21134 event pairs, 84 based on Foata normal form. 26/3363 useless extension candidates. Maximal degree in co-relation 26093. Up to 1415 conditions per place. [2022-12-05 22:39:35,700 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 222 selfloop transitions, 337 changer transitions 0/559 dead transitions. [2022-12-05 22:39:35,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 559 transitions, 11124 flow [2022-12-05 22:39:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 120 transitions. [2022-12-05 22:39:35,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23166023166023167 [2022-12-05 22:39:35,704 INFO L175 Difference]: Start difference. First operand has 184 places, 420 transitions, 8261 flow. Second operand 14 states and 120 transitions. [2022-12-05 22:39:35,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 559 transitions, 11124 flow [2022-12-05 22:39:35,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 559 transitions, 11109 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:36,006 INFO L231 Difference]: Finished difference. Result has 202 places, 481 transitions, 10676 flow [2022-12-05 22:39:36,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8246, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10676, PETRI_PLACES=202, PETRI_TRANSITIONS=481} [2022-12-05 22:39:36,007 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 184 predicate places. [2022-12-05 22:39:36,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:36,007 INFO L89 Accepts]: Start accepts. Operand has 202 places, 481 transitions, 10676 flow [2022-12-05 22:39:36,024 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:36,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:36,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 481 transitions, 10676 flow [2022-12-05 22:39:36,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 481 transitions, 10676 flow [2022-12-05 22:39:36,158 INFO L130 PetriNetUnfolder]: 349/887 cut-off events. [2022-12-05 22:39:36,159 INFO L131 PetriNetUnfolder]: For 27058/27241 co-relation queries the response was YES. [2022-12-05 22:39:36,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9099 conditions, 887 events. 349/887 cut-off events. For 27058/27241 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 6707 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 9018. Up to 495 conditions per place. [2022-12-05 22:39:36,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 481 transitions, 10676 flow [2022-12-05 22:39:36,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 1504 [2022-12-05 22:39:36,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:36,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-05 22:39:36,245 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 481 transitions, 10674 flow [2022-12-05 22:39:36,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:36,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:36,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:36,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:36,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-05 22:39:36,450 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash 550059245, now seen corresponding path program 1 times [2022-12-05 22:39:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:36,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173725377] [2022-12-05 22:39:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:36,539 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:39:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:36,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173725377] [2022-12-05 22:39:36,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173725377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:36,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026225227] [2022-12-05 22:39:36,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:36,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:36,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:36,540 INFO L229 MonitoredProcess]: Starting monitored process 22 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:39:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-05 22:39:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:36,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:36,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:36,681 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:39:36,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:36,859 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:39:36,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026225227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:36,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:36,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712670678] [2022-12-05 22:39:36,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:36,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:36,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-05 22:39:36,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 481 transitions, 10674 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:36,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:36,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-05 22:39:36,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:38,433 INFO L130 PetriNetUnfolder]: 2022/3461 cut-off events. [2022-12-05 22:39:38,433 INFO L131 PetriNetUnfolder]: For 123227/123227 co-relation queries the response was YES. [2022-12-05 22:39:38,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29500 conditions, 3461 events. 2022/3461 cut-off events. For 123227/123227 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 22379 event pairs, 322 based on Foata normal form. 28/3481 useless extension candidates. Maximal degree in co-relation 29416. Up to 2775 conditions per place. [2022-12-05 22:39:38,458 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 394 selfloop transitions, 159 changer transitions 1/554 dead transitions. [2022-12-05 22:39:38,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 554 transitions, 12685 flow [2022-12-05 22:39:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:39:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:39:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-12-05 22:39:38,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20394736842105263 [2022-12-05 22:39:38,460 INFO L175 Difference]: Start difference. First operand has 202 places, 481 transitions, 10674 flow. Second operand 12 states and 93 transitions. [2022-12-05 22:39:38,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 554 transitions, 12685 flow [2022-12-05 22:39:38,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 554 transitions, 12544 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:38,961 INFO L231 Difference]: Finished difference. Result has 214 places, 509 transitions, 11737 flow [2022-12-05 22:39:38,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=10533, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11737, PETRI_PLACES=214, PETRI_TRANSITIONS=509} [2022-12-05 22:39:38,963 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 196 predicate places. [2022-12-05 22:39:38,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:38,963 INFO L89 Accepts]: Start accepts. Operand has 214 places, 509 transitions, 11737 flow [2022-12-05 22:39:38,965 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:38,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:38,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 509 transitions, 11737 flow [2022-12-05 22:39:38,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 509 transitions, 11737 flow [2022-12-05 22:39:39,086 INFO L130 PetriNetUnfolder]: 375/950 cut-off events. [2022-12-05 22:39:39,086 INFO L131 PetriNetUnfolder]: For 30823/31096 co-relation queries the response was YES. [2022-12-05 22:39:39,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 950 events. 375/950 cut-off events. For 30823/31096 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 7216 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 9914. Up to 540 conditions per place. [2022-12-05 22:39:39,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 509 transitions, 11737 flow [2022-12-05 22:39:39,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 1556 [2022-12-05 22:39:39,099 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:39,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-05 22:39:39,099 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 509 transitions, 11737 flow [2022-12-05 22:39:39,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:39,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:39,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:39,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-05 22:39:39,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-05 22:39:39,303 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash -107052917, now seen corresponding path program 1 times [2022-12-05 22:39:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:39,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565111835] [2022-12-05 22:39:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:39,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565111835] [2022-12-05 22:39:39,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565111835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508781279] [2022-12-05 22:39:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:39,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:39,425 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39:39,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-05 22:39:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:39,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:39,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:39,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:39,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508781279] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:39,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:39,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825976330] [2022-12-05 22:39:39,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:39,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:39,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:39,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-05 22:39:39,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 509 transitions, 11737 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:39:39,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:39,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-05 22:39:39,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:44,033 INFO L130 PetriNetUnfolder]: 2228/3829 cut-off events. [2022-12-05 22:39:44,034 INFO L131 PetriNetUnfolder]: For 157920/157920 co-relation queries the response was YES. [2022-12-05 22:39:44,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33225 conditions, 3829 events. 2228/3829 cut-off events. For 157920/157920 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 25340 event pairs, 165 based on Foata normal form. 42/3863 useless extension candidates. Maximal degree in co-relation 33137. Up to 1998 conditions per place. [2022-12-05 22:39:44,111 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 301 selfloop transitions, 355 changer transitions 1/657 dead transitions. [2022-12-05 22:39:44,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 657 transitions, 15095 flow [2022-12-05 22:39:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:39:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:39:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 153 transitions. [2022-12-05 22:39:44,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19172932330827067 [2022-12-05 22:39:44,112 INFO L175 Difference]: Start difference. First operand has 214 places, 509 transitions, 11737 flow. Second operand 21 states and 153 transitions. [2022-12-05 22:39:44,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 657 transitions, 15095 flow [2022-12-05 22:39:44,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 657 transitions, 14956 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-05 22:39:44,639 INFO L231 Difference]: Finished difference. Result has 237 places, 574 transitions, 14221 flow [2022-12-05 22:39:44,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=11598, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14221, PETRI_PLACES=237, PETRI_TRANSITIONS=574} [2022-12-05 22:39:44,640 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 219 predicate places. [2022-12-05 22:39:44,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:44,640 INFO L89 Accepts]: Start accepts. Operand has 237 places, 574 transitions, 14221 flow [2022-12-05 22:39:44,642 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:44,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:44,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 574 transitions, 14221 flow [2022-12-05 22:39:44,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 574 transitions, 14221 flow [2022-12-05 22:39:44,802 INFO L130 PetriNetUnfolder]: 416/1056 cut-off events. [2022-12-05 22:39:44,802 INFO L131 PetriNetUnfolder]: For 41717/41999 co-relation queries the response was YES. [2022-12-05 22:39:44,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11925 conditions, 1056 events. 416/1056 cut-off events. For 41717/41999 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 8260 event pairs, 0 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 11831. Up to 608 conditions per place. [2022-12-05 22:39:44,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 574 transitions, 14221 flow [2022-12-05 22:39:44,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 1724 [2022-12-05 22:39:44,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:44,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-05 22:39:44,841 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 574 transitions, 14225 flow [2022-12-05 22:39:44,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:39:44,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:44,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:44,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-05 22:39:45,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:45,045 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash -118035783, now seen corresponding path program 1 times [2022-12-05 22:39:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:45,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285572395] [2022-12-05 22:39:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285572395] [2022-12-05 22:39:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285572395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042341481] [2022-12-05 22:39:45,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:45,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:45,106 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39:45,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-05 22:39:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:45,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:39:45,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:45,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:45,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042341481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:45,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:45,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-05 22:39:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520432474] [2022-12-05 22:39:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:45,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:39:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:39:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:39:45,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:39:45,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 574 transitions, 14225 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:45,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:45,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:39:45,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:45,983 INFO L130 PetriNetUnfolder]: 2329/3958 cut-off events. [2022-12-05 22:39:45,983 INFO L131 PetriNetUnfolder]: For 157094/157094 co-relation queries the response was YES. [2022-12-05 22:39:46,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36513 conditions, 3958 events. 2329/3958 cut-off events. For 157094/157094 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 26167 event pairs, 532 based on Foata normal form. 3/3953 useless extension candidates. Maximal degree in co-relation 36416. Up to 2419 conditions per place. [2022-12-05 22:39:46,012 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 755 selfloop transitions, 8 changer transitions 4/767 dead transitions. [2022-12-05 22:39:46,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 767 transitions, 20473 flow [2022-12-05 22:39:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:39:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:39:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 22:39:46,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-05 22:39:46,014 INFO L175 Difference]: Start difference. First operand has 237 places, 574 transitions, 14225 flow. Second operand 4 states and 48 transitions. [2022-12-05 22:39:46,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 767 transitions, 20473 flow [2022-12-05 22:39:46,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 767 transitions, 20017 flow, removed 160 selfloop flow, removed 6 redundant places. [2022-12-05 22:39:46,806 INFO L231 Difference]: Finished difference. Result has 235 places, 566 transitions, 13624 flow [2022-12-05 22:39:46,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13594, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13624, PETRI_PLACES=235, PETRI_TRANSITIONS=566} [2022-12-05 22:39:46,807 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 217 predicate places. [2022-12-05 22:39:46,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:46,807 INFO L89 Accepts]: Start accepts. Operand has 235 places, 566 transitions, 13624 flow [2022-12-05 22:39:46,809 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:46,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:46,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 566 transitions, 13624 flow [2022-12-05 22:39:46,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 566 transitions, 13624 flow [2022-12-05 22:39:46,976 INFO L130 PetriNetUnfolder]: 446/1103 cut-off events. [2022-12-05 22:39:46,976 INFO L131 PetriNetUnfolder]: For 44798/45064 co-relation queries the response was YES. [2022-12-05 22:39:46,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12564 conditions, 1103 events. 446/1103 cut-off events. For 44798/45064 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 8562 event pairs, 0 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 12469. Up to 636 conditions per place. [2022-12-05 22:39:46,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 566 transitions, 13624 flow [2022-12-05 22:39:46,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 1750 [2022-12-05 22:39:46,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:46,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-05 22:39:46,996 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 566 transitions, 13624 flow [2022-12-05 22:39:46,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:46,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:46,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:47,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:47,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:47,201 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 734908813, now seen corresponding path program 1 times [2022-12-05 22:39:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:47,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690312082] [2022-12-05 22:39:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690312082] [2022-12-05 22:39:47,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690312082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368285843] [2022-12-05 22:39:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:47,226 INFO L229 MonitoredProcess]: Starting monitored process 25 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:39:47,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-05 22:39:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:47,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:39:47,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:47,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:47,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368285843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:47,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:47,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:39:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083917326] [2022-12-05 22:39:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:47,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:39:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:39:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:39:47,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-05 22:39:47,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 566 transitions, 13624 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:47,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:47,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-05 22:39:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:48,110 INFO L130 PetriNetUnfolder]: 2307/3918 cut-off events. [2022-12-05 22:39:48,110 INFO L131 PetriNetUnfolder]: For 161053/161053 co-relation queries the response was YES. [2022-12-05 22:39:48,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37249 conditions, 3918 events. 2307/3918 cut-off events. For 161053/161053 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 25823 event pairs, 517 based on Foata normal form. 6/3916 useless extension candidates. Maximal degree in co-relation 37151. Up to 2075 conditions per place. [2022-12-05 22:39:48,139 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 784 selfloop transitions, 6 changer transitions 4/794 dead transitions. [2022-12-05 22:39:48,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 794 transitions, 20865 flow [2022-12-05 22:39:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:39:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:39:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 22:39:48,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3092105263157895 [2022-12-05 22:39:48,140 INFO L175 Difference]: Start difference. First operand has 235 places, 566 transitions, 13624 flow. Second operand 4 states and 47 transitions. [2022-12-05 22:39:48,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 794 transitions, 20865 flow [2022-12-05 22:39:48,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 794 transitions, 20864 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:48,929 INFO L231 Difference]: Finished difference. Result has 238 places, 560 transitions, 13535 flow [2022-12-05 22:39:48,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=13509, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13535, PETRI_PLACES=238, PETRI_TRANSITIONS=560} [2022-12-05 22:39:48,930 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 220 predicate places. [2022-12-05 22:39:48,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:48,930 INFO L89 Accepts]: Start accepts. Operand has 238 places, 560 transitions, 13535 flow [2022-12-05 22:39:48,932 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:48,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:48,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 560 transitions, 13535 flow [2022-12-05 22:39:48,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 560 transitions, 13535 flow [2022-12-05 22:39:49,077 INFO L130 PetriNetUnfolder]: 447/1102 cut-off events. [2022-12-05 22:39:49,078 INFO L131 PetriNetUnfolder]: For 44135/44433 co-relation queries the response was YES. [2022-12-05 22:39:49,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12878 conditions, 1102 events. 447/1102 cut-off events. For 44135/44433 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 8492 event pairs, 0 based on Foata normal form. 0/1098 useless extension candidates. Maximal degree in co-relation 12781. Up to 635 conditions per place. [2022-12-05 22:39:49,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 560 transitions, 13535 flow [2022-12-05 22:39:49,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-05 22:39:49,095 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:49,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-05 22:39:49,095 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 560 transitions, 13535 flow [2022-12-05 22:39:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:39:49,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:49,095 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:49,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-05 22:39:49,300 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -114311350, now seen corresponding path program 1 times [2022-12-05 22:39:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012594681] [2022-12-05 22:39:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012594681] [2022-12-05 22:39:49,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012594681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542873213] [2022-12-05 22:39:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:49,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:49,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:49,416 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39:49,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-05 22:39:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:49,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:49,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:49,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:49,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542873213] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:49,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:49,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346612864] [2022-12-05 22:39:49,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:49,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:49,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:49,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 560 transitions, 13535 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:39:49,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:49,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:49,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:52,462 INFO L130 PetriNetUnfolder]: 2417/4120 cut-off events. [2022-12-05 22:39:52,462 INFO L131 PetriNetUnfolder]: For 212188/212188 co-relation queries the response was YES. [2022-12-05 22:39:52,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40721 conditions, 4120 events. 2417/4120 cut-off events. For 212188/212188 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 27374 event pairs, 393 based on Foata normal form. 48/4160 useless extension candidates. Maximal degree in co-relation 40621. Up to 3155 conditions per place. [2022-12-05 22:39:52,499 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 453 selfloop transitions, 206 changer transitions 1/660 dead transitions. [2022-12-05 22:39:52,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 660 transitions, 16261 flow [2022-12-05 22:39:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:39:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:39:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-05 22:39:52,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20997920997921 [2022-12-05 22:39:52,500 INFO L175 Difference]: Start difference. First operand has 238 places, 560 transitions, 13535 flow. Second operand 13 states and 101 transitions. [2022-12-05 22:39:52,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 660 transitions, 16261 flow [2022-12-05 22:39:53,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 660 transitions, 16240 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:53,396 INFO L231 Difference]: Finished difference. Result has 254 places, 592 transitions, 15149 flow [2022-12-05 22:39:53,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13532, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15149, PETRI_PLACES=254, PETRI_TRANSITIONS=592} [2022-12-05 22:39:53,397 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 236 predicate places. [2022-12-05 22:39:53,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:53,397 INFO L89 Accepts]: Start accepts. Operand has 254 places, 592 transitions, 15149 flow [2022-12-05 22:39:53,399 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:53,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:53,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 592 transitions, 15149 flow [2022-12-05 22:39:53,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 592 transitions, 15149 flow [2022-12-05 22:39:53,686 INFO L130 PetriNetUnfolder]: 481/1192 cut-off events. [2022-12-05 22:39:53,686 INFO L131 PetriNetUnfolder]: For 54981/55334 co-relation queries the response was YES. [2022-12-05 22:39:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14538 conditions, 1192 events. 481/1192 cut-off events. For 54981/55334 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 9387 event pairs, 2 based on Foata normal form. 0/1190 useless extension candidates. Maximal degree in co-relation 14435. Up to 694 conditions per place. [2022-12-05 22:39:53,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 592 transitions, 15149 flow [2022-12-05 22:39:53,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 1814 [2022-12-05 22:39:53,713 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:53,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 316 [2022-12-05 22:39:53,713 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 592 transitions, 15149 flow [2022-12-05 22:39:53,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:39:53,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:53,714 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:53,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:53,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-05 22:39:53,921 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash 333331119, now seen corresponding path program 2 times [2022-12-05 22:39:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:53,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485185519] [2022-12-05 22:39:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:54,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485185519] [2022-12-05 22:39:54,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485185519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:54,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893867446] [2022-12-05 22:39:54,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:39:54,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:54,104 INFO L229 MonitoredProcess]: Starting monitored process 27 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:39:54,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-05 22:39:54,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:39:54,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:39:54,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:39:54,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:54,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893867446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:54,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:39:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796135613] [2022-12-05 22:39:54,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:39:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:39:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:39:54,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:54,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 592 transitions, 15149 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:54,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:54,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:54,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:57,316 INFO L130 PetriNetUnfolder]: 3165/5280 cut-off events. [2022-12-05 22:39:57,316 INFO L131 PetriNetUnfolder]: For 346545/346545 co-relation queries the response was YES. [2022-12-05 22:39:57,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56601 conditions, 5280 events. 3165/5280 cut-off events. For 346545/346545 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 35509 event pairs, 93 based on Foata normal form. 48/5320 useless extension candidates. Maximal degree in co-relation 56495. Up to 2088 conditions per place. [2022-12-05 22:39:57,367 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 215 selfloop transitions, 608 changer transitions 0/823 dead transitions. [2022-12-05 22:39:57,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 823 transitions, 20982 flow [2022-12-05 22:39:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:39:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:39:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-12-05 22:39:57,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2076167076167076 [2022-12-05 22:39:57,369 INFO L175 Difference]: Start difference. First operand has 254 places, 592 transitions, 15149 flow. Second operand 22 states and 169 transitions. [2022-12-05 22:39:57,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 823 transitions, 20982 flow [2022-12-05 22:39:58,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 823 transitions, 20606 flow, removed 152 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:58,647 INFO L231 Difference]: Finished difference. Result has 276 places, 695 transitions, 19574 flow [2022-12-05 22:39:58,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14827, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19574, PETRI_PLACES=276, PETRI_TRANSITIONS=695} [2022-12-05 22:39:58,648 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 258 predicate places. [2022-12-05 22:39:58,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:58,648 INFO L89 Accepts]: Start accepts. Operand has 276 places, 695 transitions, 19574 flow [2022-12-05 22:39:58,652 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:58,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:58,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 695 transitions, 19574 flow [2022-12-05 22:39:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 695 transitions, 19574 flow [2022-12-05 22:39:58,910 INFO L130 PetriNetUnfolder]: 642/1529 cut-off events. [2022-12-05 22:39:58,910 INFO L131 PetriNetUnfolder]: For 96650/97108 co-relation queries the response was YES. [2022-12-05 22:39:58,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20880 conditions, 1529 events. 642/1529 cut-off events. For 96650/97108 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 12353 event pairs, 6 based on Foata normal form. 4/1531 useless extension candidates. Maximal degree in co-relation 20771. Up to 924 conditions per place. [2022-12-05 22:39:58,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 695 transitions, 19574 flow [2022-12-05 22:39:58,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 2192 [2022-12-05 22:39:58,939 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:58,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-05 22:39:58,940 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 695 transitions, 19574 flow [2022-12-05 22:39:58,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:58,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:58,940 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:58,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-05 22:39:59,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-05 22:39:59,144 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 889326101, now seen corresponding path program 2 times [2022-12-05 22:39:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:59,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680631474] [2022-12-05 22:39:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:59,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680631474] [2022-12-05 22:39:59,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680631474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:59,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124461363] [2022-12-05 22:39:59,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:39:59,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:59,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:59,270 INFO L229 MonitoredProcess]: Starting monitored process 28 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:39:59,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-05 22:39:59,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:39:59,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:39:59,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:39:59,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:59,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:59,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124461363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:59,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:59,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:39:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227361383] [2022-12-05 22:39:59,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:39:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:39:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:39:59,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:59,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 695 transitions, 19574 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:59,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:59,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:59,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:08,246 INFO L130 PetriNetUnfolder]: 3543/5898 cut-off events. [2022-12-05 22:40:08,246 INFO L131 PetriNetUnfolder]: For 499536/499536 co-relation queries the response was YES. [2022-12-05 22:40:08,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66568 conditions, 5898 events. 3543/5898 cut-off events. For 499536/499536 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 40040 event pairs, 235 based on Foata normal form. 106/5996 useless extension candidates. Maximal degree in co-relation 66456. Up to 3107 conditions per place. [2022-12-05 22:40:08,306 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 448 selfloop transitions, 487 changer transitions 4/939 dead transitions. [2022-12-05 22:40:08,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 939 transitions, 25033 flow [2022-12-05 22:40:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-05 22:40:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-05 22:40:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 216 transitions. [2022-12-05 22:40:08,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17170111287758347 [2022-12-05 22:40:08,307 INFO L175 Difference]: Start difference. First operand has 276 places, 695 transitions, 19574 flow. Second operand 34 states and 216 transitions. [2022-12-05 22:40:08,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 939 transitions, 25033 flow [2022-12-05 22:40:10,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 939 transitions, 23835 flow, removed 509 selfloop flow, removed 13 redundant places. [2022-12-05 22:40:10,199 INFO L231 Difference]: Finished difference. Result has 307 places, 760 transitions, 22107 flow [2022-12-05 22:40:10,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=434, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=22107, PETRI_PLACES=307, PETRI_TRANSITIONS=760} [2022-12-05 22:40:10,200 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 289 predicate places. [2022-12-05 22:40:10,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:10,200 INFO L89 Accepts]: Start accepts. Operand has 307 places, 760 transitions, 22107 flow [2022-12-05 22:40:10,204 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:10,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:10,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 760 transitions, 22107 flow [2022-12-05 22:40:10,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 760 transitions, 22107 flow [2022-12-05 22:40:10,615 INFO L130 PetriNetUnfolder]: 737/1740 cut-off events. [2022-12-05 22:40:10,616 INFO L131 PetriNetUnfolder]: For 111362/111812 co-relation queries the response was YES. [2022-12-05 22:40:10,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24066 conditions, 1740 events. 737/1740 cut-off events. For 111362/111812 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 14274 event pairs, 5 based on Foata normal form. 2/1740 useless extension candidates. Maximal degree in co-relation 23950. Up to 915 conditions per place. [2022-12-05 22:40:10,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 760 transitions, 22107 flow [2022-12-05 22:40:10,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 2428 [2022-12-05 22:40:10,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:40:10,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:40:10,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [379] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_243) v_~x~0_242) (= (* 2 v_~next~0_132) (+ (* 3 v_~prev~0_256) (* 21 v_~prev~0_257) (* 34 v_~cur~0_212))) (= (+ v_~q~0_222 1) v_~q~0_221) (= v_~j~0_315 (+ v_~j~0_316 v_~i~0_251)) (= (* 5 v_~prev~0_256) (+ (* v_~prev~0_257 13) (* 21 v_~cur~0_212) (* 3 v_~next~0_132))) (= v_~next~0_132 v_~cur~0_211) (< v_~q~0_222 5) (< v_~x~0_243 1)) InVars {~j~0=v_~j~0_316, ~prev~0=v_~prev~0_257, ~i~0=v_~i~0_251, ~q~0=v_~q~0_222, ~cur~0=v_~cur~0_212, ~x~0=v_~x~0_243} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_153|, ~j~0=v_~j~0_315, ~next~0=v_~next~0_132, ~prev~0=v_~prev~0_256, ~i~0=v_~i~0_251, ~q~0=v_~q~0_221, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_159|, ~cur~0=v_~cur~0_211, ~x~0=v_~x~0_242} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:40:10,879 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:40:10,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 680 [2022-12-05 22:40:10,880 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 760 transitions, 22131 flow [2022-12-05 22:40:10,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:10,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:10,880 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:10,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-05 22:40:11,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-05 22:40:11,082 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash 88753991, now seen corresponding path program 2 times [2022-12-05 22:40:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:11,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091975847] [2022-12-05 22:40:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:11,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091975847] [2022-12-05 22:40:11,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091975847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131929680] [2022-12-05 22:40:11,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:40:11,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:11,137 INFO L229 MonitoredProcess]: Starting monitored process 29 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:40:11,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-05 22:40:11,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:40:11,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:40:11,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:40:11,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:11,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:40:11,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131929680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:11,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:40:11,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-12-05 22:40:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519716216] [2022-12-05 22:40:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:11,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:40:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:40:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:40:11,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:40:11,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 760 transitions, 22131 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:40:11,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:11,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:40:11,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:12,626 INFO L130 PetriNetUnfolder]: 3505/5880 cut-off events. [2022-12-05 22:40:12,626 INFO L131 PetriNetUnfolder]: For 380741/380741 co-relation queries the response was YES. [2022-12-05 22:40:12,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66770 conditions, 5880 events. 3505/5880 cut-off events. For 380741/380741 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 41914 event pairs, 585 based on Foata normal form. 102/5974 useless extension candidates. Maximal degree in co-relation 66651. Up to 3003 conditions per place. [2022-12-05 22:40:12,687 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 1139 selfloop transitions, 71 changer transitions 14/1224 dead transitions. [2022-12-05 22:40:12,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1224 transitions, 38355 flow [2022-12-05 22:40:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:40:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:40:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-05 22:40:12,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3547008547008547 [2022-12-05 22:40:12,688 INFO L175 Difference]: Start difference. First operand has 307 places, 760 transitions, 22131 flow. Second operand 6 states and 83 transitions. [2022-12-05 22:40:12,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1224 transitions, 38355 flow [2022-12-05 22:40:14,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1224 transitions, 36736 flow, removed 634 selfloop flow, removed 16 redundant places. [2022-12-05 22:40:14,391 INFO L231 Difference]: Finished difference. Result has 299 places, 782 transitions, 22332 flow [2022-12-05 22:40:14,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=20794, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22332, PETRI_PLACES=299, PETRI_TRANSITIONS=782} [2022-12-05 22:40:14,391 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 281 predicate places. [2022-12-05 22:40:14,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:14,392 INFO L89 Accepts]: Start accepts. Operand has 299 places, 782 transitions, 22332 flow [2022-12-05 22:40:14,394 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:14,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:14,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 782 transitions, 22332 flow [2022-12-05 22:40:14,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 782 transitions, 22332 flow [2022-12-05 22:40:14,787 INFO L130 PetriNetUnfolder]: 701/1724 cut-off events. [2022-12-05 22:40:14,787 INFO L131 PetriNetUnfolder]: For 114873/115347 co-relation queries the response was YES. [2022-12-05 22:40:14,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23724 conditions, 1724 events. 701/1724 cut-off events. For 114873/115347 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 14457 event pairs, 3 based on Foata normal form. 20/1741 useless extension candidates. Maximal degree in co-relation 23605. Up to 900 conditions per place. [2022-12-05 22:40:14,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 782 transitions, 22332 flow [2022-12-05 22:40:14,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 2534 [2022-12-05 22:40:14,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:40:14,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 479 [2022-12-05 22:40:14,870 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 782 transitions, 22345 flow [2022-12-05 22:40:14,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:40:14,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:14,870 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:14,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:15,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:15,074 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash 734997008, now seen corresponding path program 1 times [2022-12-05 22:40:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:15,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532374434] [2022-12-05 22:40:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:15,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532374434] [2022-12-05 22:40:15,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532374434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:15,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179563398] [2022-12-05 22:40:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:15,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:15,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:15,105 INFO L229 MonitoredProcess]: Starting monitored process 30 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:40:15,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-05 22:40:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:15,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:40:15,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:15,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:40:15,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179563398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:15,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:40:15,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-05 22:40:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960989052] [2022-12-05 22:40:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:15,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:40:15,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:40:15,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:40:15,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-05 22:40:15,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 782 transitions, 22345 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:40:15,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:15,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-05 22:40:15,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:16,562 INFO L130 PetriNetUnfolder]: 3427/5784 cut-off events. [2022-12-05 22:40:16,562 INFO L131 PetriNetUnfolder]: For 382022/382022 co-relation queries the response was YES. [2022-12-05 22:40:16,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66768 conditions, 5784 events. 3427/5784 cut-off events. For 382022/382022 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 40470 event pairs, 652 based on Foata normal form. 3/5779 useless extension candidates. Maximal degree in co-relation 66646. Up to 3069 conditions per place. [2022-12-05 22:40:16,622 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 1100 selfloop transitions, 6 changer transitions 43/1149 dead transitions. [2022-12-05 22:40:16,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1149 transitions, 35629 flow [2022-12-05 22:40:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:40:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:40:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 22:40:16,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30625 [2022-12-05 22:40:16,623 INFO L175 Difference]: Start difference. First operand has 298 places, 782 transitions, 22345 flow. Second operand 4 states and 49 transitions. [2022-12-05 22:40:16,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 1149 transitions, 35629 flow [2022-12-05 22:40:18,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 1149 transitions, 35118 flow, removed 255 selfloop flow, removed 1 redundant places. [2022-12-05 22:40:18,391 INFO L231 Difference]: Finished difference. Result has 300 places, 777 transitions, 21986 flow [2022-12-05 22:40:18,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21974, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=21986, PETRI_PLACES=300, PETRI_TRANSITIONS=777} [2022-12-05 22:40:18,392 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 282 predicate places. [2022-12-05 22:40:18,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:18,392 INFO L89 Accepts]: Start accepts. Operand has 300 places, 777 transitions, 21986 flow [2022-12-05 22:40:18,396 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:18,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:18,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 777 transitions, 21986 flow [2022-12-05 22:40:18,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 777 transitions, 21986 flow [2022-12-05 22:40:18,733 INFO L130 PetriNetUnfolder]: 705/1757 cut-off events. [2022-12-05 22:40:18,734 INFO L131 PetriNetUnfolder]: For 115087/115774 co-relation queries the response was YES. [2022-12-05 22:40:18,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24189 conditions, 1757 events. 705/1757 cut-off events. For 115087/115774 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 14951 event pairs, 3 based on Foata normal form. 12/1765 useless extension candidates. Maximal degree in co-relation 24069. Up to 914 conditions per place. [2022-12-05 22:40:18,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 777 transitions, 21986 flow [2022-12-05 22:40:18,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 2458 [2022-12-05 22:40:18,766 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:40:18,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 375 [2022-12-05 22:40:18,767 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 777 transitions, 21986 flow [2022-12-05 22:40:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:40:18,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:18,767 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:18,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:18,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:18,970 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 481631382, now seen corresponding path program 1 times [2022-12-05 22:40:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:18,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460653754] [2022-12-05 22:40:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:18,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460653754] [2022-12-05 22:40:19,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460653754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:19,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452971484] [2022-12-05 22:40:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:19,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:19,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:19,014 INFO L229 MonitoredProcess]: Starting monitored process 31 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:40:19,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-05 22:40:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:19,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 22:40:19,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:19,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:40:19,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452971484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:19,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:40:19,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-05 22:40:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627988213] [2022-12-05 22:40:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:40:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:40:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:40:19,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:40:19,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 777 transitions, 21986 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:40:19,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:19,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:40:19,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:20,683 INFO L130 PetriNetUnfolder]: 3582/6011 cut-off events. [2022-12-05 22:40:20,683 INFO L131 PetriNetUnfolder]: For 407879/407879 co-relation queries the response was YES. [2022-12-05 22:40:20,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70148 conditions, 6011 events. 3582/6011 cut-off events. For 407879/407879 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 42762 event pairs, 481 based on Foata normal form. 68/6071 useless extension candidates. Maximal degree in co-relation 70025. Up to 3250 conditions per place. [2022-12-05 22:40:20,740 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 1132 selfloop transitions, 186 changer transitions 12/1330 dead transitions. [2022-12-05 22:40:20,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 1330 transitions, 40376 flow [2022-12-05 22:40:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:40:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:40:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-05 22:40:20,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.336996336996337 [2022-12-05 22:40:20,741 INFO L175 Difference]: Start difference. First operand has 300 places, 777 transitions, 21986 flow. Second operand 7 states and 92 transitions. [2022-12-05 22:40:20,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 1330 transitions, 40376 flow [2022-12-05 22:40:22,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 1330 transitions, 40361 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:40:22,463 INFO L231 Difference]: Finished difference. Result has 308 places, 834 transitions, 24735 flow [2022-12-05 22:40:22,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=21659, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24735, PETRI_PLACES=308, PETRI_TRANSITIONS=834} [2022-12-05 22:40:22,464 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 290 predicate places. [2022-12-05 22:40:22,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:22,465 INFO L89 Accepts]: Start accepts. Operand has 308 places, 834 transitions, 24735 flow [2022-12-05 22:40:22,475 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:22,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:22,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 834 transitions, 24735 flow [2022-12-05 22:40:22,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 834 transitions, 24735 flow [2022-12-05 22:40:22,835 INFO L130 PetriNetUnfolder]: 736/1834 cut-off events. [2022-12-05 22:40:22,835 INFO L131 PetriNetUnfolder]: For 138499/139241 co-relation queries the response was YES. [2022-12-05 22:40:22,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26444 conditions, 1834 events. 736/1834 cut-off events. For 138499/139241 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 15755 event pairs, 2 based on Foata normal form. 34/1864 useless extension candidates. Maximal degree in co-relation 26320. Up to 960 conditions per place. [2022-12-05 22:40:22,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 834 transitions, 24735 flow [2022-12-05 22:40:22,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 2690 [2022-12-05 22:40:22,873 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:40:22,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 409 [2022-12-05 22:40:22,874 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 834 transitions, 24735 flow [2022-12-05 22:40:22,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:40:22,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:22,874 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:22,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:23,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-05 22:40:23,077 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1799695616, now seen corresponding path program 2 times [2022-12-05 22:40:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:23,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128006033] [2022-12-05 22:40:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:23,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128006033] [2022-12-05 22:40:23,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128006033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:23,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387207920] [2022-12-05 22:40:23,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:40:23,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:23,182 INFO L229 MonitoredProcess]: Starting monitored process 32 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:40:23,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-05 22:40:23,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:40:23,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:40:23,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:40:23,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:23,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:23,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387207920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:23,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:23,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:40:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840692648] [2022-12-05 22:40:23,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:23,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:40:23,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:23,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:40:23,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:40:23,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:40:23,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 834 transitions, 24735 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:23,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:23,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:40:23,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:27,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:31,705 INFO L130 PetriNetUnfolder]: 3702/6255 cut-off events. [2022-12-05 22:40:31,705 INFO L131 PetriNetUnfolder]: For 519204/519204 co-relation queries the response was YES. [2022-12-05 22:40:31,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76041 conditions, 6255 events. 3702/6255 cut-off events. For 519204/519204 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 43923 event pairs, 552 based on Foata normal form. 56/6303 useless extension candidates. Maximal degree in co-relation 75914. Up to 4946 conditions per place. [2022-12-05 22:40:31,769 INFO L137 encePairwiseOnDemand]: 9/39 looper letters, 697 selfloop transitions, 310 changer transitions 8/1015 dead transitions. [2022-12-05 22:40:31,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1015 transitions, 29988 flow [2022-12-05 22:40:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:40:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:40:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 184 transitions. [2022-12-05 22:40:31,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14743589743589744 [2022-12-05 22:40:31,771 INFO L175 Difference]: Start difference. First operand has 308 places, 834 transitions, 24735 flow. Second operand 32 states and 184 transitions. [2022-12-05 22:40:31,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1015 transitions, 29988 flow [2022-12-05 22:40:34,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1015 transitions, 29298 flow, removed 325 selfloop flow, removed 2 redundant places. [2022-12-05 22:40:34,206 INFO L231 Difference]: Finished difference. Result has 342 places, 895 transitions, 27162 flow [2022-12-05 22:40:34,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=24093, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=27162, PETRI_PLACES=342, PETRI_TRANSITIONS=895} [2022-12-05 22:40:34,207 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 324 predicate places. [2022-12-05 22:40:34,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:34,207 INFO L89 Accepts]: Start accepts. Operand has 342 places, 895 transitions, 27162 flow [2022-12-05 22:40:34,212 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:34,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:34,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 342 places, 895 transitions, 27162 flow [2022-12-05 22:40:34,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 895 transitions, 27162 flow [2022-12-05 22:40:34,611 INFO L130 PetriNetUnfolder]: 784/1946 cut-off events. [2022-12-05 22:40:34,611 INFO L131 PetriNetUnfolder]: For 164467/165199 co-relation queries the response was YES. [2022-12-05 22:40:34,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28664 conditions, 1946 events. 784/1946 cut-off events. For 164467/165199 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 16829 event pairs, 5 based on Foata normal form. 30/1972 useless extension candidates. Maximal degree in co-relation 28535. Up to 1035 conditions per place. [2022-12-05 22:40:34,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 895 transitions, 27162 flow [2022-12-05 22:40:34,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 2802 [2022-12-05 22:40:34,839 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:40:34,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-05 22:40:34,840 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 895 transitions, 27228 flow [2022-12-05 22:40:34,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:34,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:34,840 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:34,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:35,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:35,044 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash 975749792, now seen corresponding path program 2 times [2022-12-05 22:40:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:35,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449526958] [2022-12-05 22:40:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449526958] [2022-12-05 22:40:35,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449526958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836044057] [2022-12-05 22:40:35,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:40:35,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:35,075 INFO L229 MonitoredProcess]: Starting monitored process 33 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:40:35,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-05 22:40:35,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:40:35,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:40:35,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:40:35,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:35,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:40:35,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836044057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:35,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:40:35,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:40:35,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302642860] [2022-12-05 22:40:35,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:35,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:40:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:35,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:40:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:40:35,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-05 22:40:35,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 895 transitions, 27228 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:40:35,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:35,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-05 22:40:35,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:36,963 INFO L130 PetriNetUnfolder]: 3488/5946 cut-off events. [2022-12-05 22:40:36,964 INFO L131 PetriNetUnfolder]: For 463889/463889 co-relation queries the response was YES. [2022-12-05 22:40:36,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73326 conditions, 5946 events. 3488/5946 cut-off events. For 463889/463889 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 42437 event pairs, 555 based on Foata normal form. 87/6025 useless extension candidates. Maximal degree in co-relation 73194. Up to 2948 conditions per place. [2022-12-05 22:40:37,021 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 1217 selfloop transitions, 27 changer transitions 67/1311 dead transitions. [2022-12-05 22:40:37,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1311 transitions, 43138 flow [2022-12-05 22:40:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:40:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:40:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-05 22:40:37,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2022-12-05 22:40:37,022 INFO L175 Difference]: Start difference. First operand has 342 places, 895 transitions, 27228 flow. Second operand 5 states and 64 transitions. [2022-12-05 22:40:37,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1311 transitions, 43138 flow [2022-12-05 22:40:38,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1311 transitions, 41934 flow, removed 562 selfloop flow, removed 10 redundant places. [2022-12-05 22:40:38,993 INFO L231 Difference]: Finished difference. Result has 338 places, 843 transitions, 25127 flow [2022-12-05 22:40:38,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=24774, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=25127, PETRI_PLACES=338, PETRI_TRANSITIONS=843} [2022-12-05 22:40:38,993 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 320 predicate places. [2022-12-05 22:40:38,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:38,994 INFO L89 Accepts]: Start accepts. Operand has 338 places, 843 transitions, 25127 flow [2022-12-05 22:40:38,998 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:38,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:39,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 338 places, 843 transitions, 25127 flow [2022-12-05 22:40:39,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 843 transitions, 25127 flow [2022-12-05 22:40:39,381 INFO L130 PetriNetUnfolder]: 707/1820 cut-off events. [2022-12-05 22:40:39,381 INFO L131 PetriNetUnfolder]: For 156448/157251 co-relation queries the response was YES. [2022-12-05 22:40:39,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26971 conditions, 1820 events. 707/1820 cut-off events. For 156448/157251 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 15862 event pairs, 3 based on Foata normal form. 41/1857 useless extension candidates. Maximal degree in co-relation 26839. Up to 898 conditions per place. [2022-12-05 22:40:39,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 843 transitions, 25127 flow [2022-12-05 22:40:39,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-05 22:40:39,416 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:40:39,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 423 [2022-12-05 22:40:39,417 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 843 transitions, 25127 flow [2022-12-05 22:40:39,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:40:39,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:39,417 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:39,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-05 22:40:39,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:39,621 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1817225217, now seen corresponding path program 1 times [2022-12-05 22:40:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:39,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421603636] [2022-12-05 22:40:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:39,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421603636] [2022-12-05 22:40:39,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421603636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:39,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598882093] [2022-12-05 22:40:39,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:39,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:39,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:39,725 INFO L229 MonitoredProcess]: Starting monitored process 34 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:40:39,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-05 22:40:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:39,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:40:39,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:39,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598882093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:40,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:40,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:40:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245928455] [2022-12-05 22:40:40,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:40,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:40:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:40:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:40:40,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-05 22:40:40,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 843 transitions, 25127 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:40,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:40,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-05 22:40:40,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:47,801 INFO L130 PetriNetUnfolder]: 3609/6180 cut-off events. [2022-12-05 22:40:47,802 INFO L131 PetriNetUnfolder]: For 535247/535247 co-relation queries the response was YES. [2022-12-05 22:40:47,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77358 conditions, 6180 events. 3609/6180 cut-off events. For 535247/535247 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 43999 event pairs, 480 based on Foata normal form. 42/6214 useless extension candidates. Maximal degree in co-relation 77223. Up to 4721 conditions per place. [2022-12-05 22:40:47,929 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 668 selfloop transitions, 356 changer transitions 5/1029 dead transitions. [2022-12-05 22:40:47,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1029 transitions, 30618 flow [2022-12-05 22:40:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 22:40:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 22:40:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 176 transitions. [2022-12-05 22:40:47,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1444991789819376 [2022-12-05 22:40:47,930 INFO L175 Difference]: Start difference. First operand has 335 places, 843 transitions, 25127 flow. Second operand 29 states and 176 transitions. [2022-12-05 22:40:47,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1029 transitions, 30618 flow [2022-12-05 22:40:50,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1029 transitions, 30401 flow, removed 77 selfloop flow, removed 5 redundant places. [2022-12-05 22:40:50,646 INFO L231 Difference]: Finished difference. Result has 365 places, 909 transitions, 28282 flow [2022-12-05 22:40:50,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=24972, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=28282, PETRI_PLACES=365, PETRI_TRANSITIONS=909} [2022-12-05 22:40:50,647 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 347 predicate places. [2022-12-05 22:40:50,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:50,647 INFO L89 Accepts]: Start accepts. Operand has 365 places, 909 transitions, 28282 flow [2022-12-05 22:40:50,651 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:50,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:50,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 909 transitions, 28282 flow [2022-12-05 22:40:50,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 365 places, 909 transitions, 28282 flow [2022-12-05 22:40:51,080 INFO L130 PetriNetUnfolder]: 740/1920 cut-off events. [2022-12-05 22:40:51,080 INFO L131 PetriNetUnfolder]: For 178391/179055 co-relation queries the response was YES. [2022-12-05 22:40:51,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29203 conditions, 1920 events. 740/1920 cut-off events. For 178391/179055 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 17025 event pairs, 3 based on Foata normal form. 45/1961 useless extension candidates. Maximal degree in co-relation 29064. Up to 965 conditions per place. [2022-12-05 22:40:51,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 909 transitions, 28282 flow [2022-12-05 22:40:51,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 2798 [2022-12-05 22:40:51,354 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:40:51,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 707 [2022-12-05 22:40:51,354 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 909 transitions, 28320 flow [2022-12-05 22:40:51,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:51,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:51,354 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:51,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:51,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-05 22:40:51,555 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1021002321, now seen corresponding path program 1 times [2022-12-05 22:40:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690504609] [2022-12-05 22:40:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:51,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:51,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690504609] [2022-12-05 22:40:51,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690504609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:51,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907658459] [2022-12-05 22:40:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:51,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:51,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:51,680 INFO L229 MonitoredProcess]: Starting monitored process 35 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:40:51,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-05 22:40:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:51,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:40:51,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:51,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:52,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907658459] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:52,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:52,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:40:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304386073] [2022-12-05 22:40:52,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:52,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:40:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:40:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:40:52,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-05 22:40:52,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 909 transitions, 28320 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:52,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:52,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-05 22:40:52,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:57,136 INFO L130 PetriNetUnfolder]: 4149/7112 cut-off events. [2022-12-05 22:40:57,137 INFO L131 PetriNetUnfolder]: For 798837/798837 co-relation queries the response was YES. [2022-12-05 22:40:57,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92965 conditions, 7112 events. 4149/7112 cut-off events. For 798837/798837 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 51885 event pairs, 277 based on Foata normal form. 76/7180 useless extension candidates. Maximal degree in co-relation 92823. Up to 3768 conditions per place. [2022-12-05 22:40:57,223 INFO L137 encePairwiseOnDemand]: 8/44 looper letters, 577 selfloop transitions, 646 changer transitions 10/1233 dead transitions. [2022-12-05 22:40:57,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1233 transitions, 37790 flow [2022-12-05 22:40:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-05 22:40:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-05 22:40:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 234 transitions. [2022-12-05 22:40:57,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15194805194805194 [2022-12-05 22:40:57,225 INFO L175 Difference]: Start difference. First operand has 365 places, 909 transitions, 28320 flow. Second operand 35 states and 234 transitions. [2022-12-05 22:40:57,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1233 transitions, 37790 flow [2022-12-05 22:41:01,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1233 transitions, 36998 flow, removed 338 selfloop flow, removed 9 redundant places. [2022-12-05 22:41:01,141 INFO L231 Difference]: Finished difference. Result has 403 places, 1045 transitions, 34634 flow [2022-12-05 22:41:01,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=27618, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=526, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=34634, PETRI_PLACES=403, PETRI_TRANSITIONS=1045} [2022-12-05 22:41:01,142 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 385 predicate places. [2022-12-05 22:41:01,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:01,142 INFO L89 Accepts]: Start accepts. Operand has 403 places, 1045 transitions, 34634 flow [2022-12-05 22:41:01,149 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:01,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:01,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 1045 transitions, 34634 flow [2022-12-05 22:41:01,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 1045 transitions, 34634 flow [2022-12-05 22:41:01,701 INFO L130 PetriNetUnfolder]: 852/2206 cut-off events. [2022-12-05 22:41:01,701 INFO L131 PetriNetUnfolder]: For 253468/254171 co-relation queries the response was YES. [2022-12-05 22:41:01,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35983 conditions, 2206 events. 852/2206 cut-off events. For 253468/254171 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 20164 event pairs, 4 based on Foata normal form. 41/2243 useless extension candidates. Maximal degree in co-relation 35830. Up to 1086 conditions per place. [2022-12-05 22:41:01,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 1045 transitions, 34634 flow [2022-12-05 22:41:01,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 3176 [2022-12-05 22:41:01,781 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:41:01,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-05 22:41:01,783 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 1045 transitions, 34634 flow [2022-12-05 22:41:01,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:01,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:01,783 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:01,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:01,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-05 22:41:01,987 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -519449927, now seen corresponding path program 1 times [2022-12-05 22:41:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:01,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827586931] [2022-12-05 22:41:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:02,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:02,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827586931] [2022-12-05 22:41:02,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827586931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:02,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249397610] [2022-12-05 22:41:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:02,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:02,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:02,133 INFO L229 MonitoredProcess]: Starting monitored process 36 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:41:02,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-05 22:41:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:02,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:41:02,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:02,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249397610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:02,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:02,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:41:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524246556] [2022-12-05 22:41:02,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:02,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:41:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:41:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:41:02,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-05 22:41:02,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1045 transitions, 34634 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:02,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:02,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-05 22:41:02,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:09,265 INFO L130 PetriNetUnfolder]: 4309/7424 cut-off events. [2022-12-05 22:41:09,265 INFO L131 PetriNetUnfolder]: For 840566/840566 co-relation queries the response was YES. [2022-12-05 22:41:09,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101543 conditions, 7424 events. 4309/7424 cut-off events. For 840566/840566 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 55005 event pairs, 633 based on Foata normal form. 38/7454 useless extension candidates. Maximal degree in co-relation 101387. Up to 5572 conditions per place. [2022-12-05 22:41:09,347 INFO L137 encePairwiseOnDemand]: 9/44 looper letters, 784 selfloop transitions, 444 changer transitions 7/1235 dead transitions. [2022-12-05 22:41:09,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1235 transitions, 41043 flow [2022-12-05 22:41:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-05 22:41:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-05 22:41:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 182 transitions. [2022-12-05 22:41:09,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13343108504398826 [2022-12-05 22:41:09,352 INFO L175 Difference]: Start difference. First operand has 403 places, 1045 transitions, 34634 flow. Second operand 31 states and 182 transitions. [2022-12-05 22:41:09,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1235 transitions, 41043 flow [2022-12-05 22:41:13,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1235 transitions, 39598 flow, removed 646 selfloop flow, removed 9 redundant places. [2022-12-05 22:41:14,003 INFO L231 Difference]: Finished difference. Result has 430 places, 1111 transitions, 37358 flow [2022-12-05 22:41:14,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=33261, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=37358, PETRI_PLACES=430, PETRI_TRANSITIONS=1111} [2022-12-05 22:41:14,004 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 412 predicate places. [2022-12-05 22:41:14,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:14,004 INFO L89 Accepts]: Start accepts. Operand has 430 places, 1111 transitions, 37358 flow [2022-12-05 22:41:14,011 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:14,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:14,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 1111 transitions, 37358 flow [2022-12-05 22:41:14,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 1111 transitions, 37358 flow [2022-12-05 22:41:14,679 INFO L130 PetriNetUnfolder]: 888/2325 cut-off events. [2022-12-05 22:41:14,679 INFO L131 PetriNetUnfolder]: For 285923/286644 co-relation queries the response was YES. [2022-12-05 22:41:14,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37995 conditions, 2325 events. 888/2325 cut-off events. For 285923/286644 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 21547 event pairs, 4 based on Foata normal form. 42/2363 useless extension candidates. Maximal degree in co-relation 37837. Up to 1120 conditions per place. [2022-12-05 22:41:14,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 1111 transitions, 37358 flow [2022-12-05 22:41:14,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 3324 [2022-12-05 22:41:14,977 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:41:14,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 973 [2022-12-05 22:41:14,977 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1111 transitions, 37446 flow [2022-12-05 22:41:14,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:14,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:14,977 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:14,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:15,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-05 22:41:15,178 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash 992373728, now seen corresponding path program 1 times [2022-12-05 22:41:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:15,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916928815] [2022-12-05 22:41:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916928815] [2022-12-05 22:41:15,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916928815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384174821] [2022-12-05 22:41:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:15,279 INFO L229 MonitoredProcess]: Starting monitored process 37 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:41:15,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-05 22:41:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:15,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:41:15,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:15,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:15,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384174821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:15,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:15,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:41:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719501627] [2022-12-05 22:41:15,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:41:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:41:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:41:15,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-05 22:41:15,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1111 transitions, 37446 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:15,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:15,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-05 22:41:15,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:19,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:26,219 INFO L130 PetriNetUnfolder]: 4606/7959 cut-off events. [2022-12-05 22:41:26,219 INFO L131 PetriNetUnfolder]: For 1074860/1074860 co-relation queries the response was YES. [2022-12-05 22:41:26,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108732 conditions, 7959 events. 4606/7959 cut-off events. For 1074860/1074860 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 59888 event pairs, 435 based on Foata normal form. 66/8017 useless extension candidates. Maximal degree in co-relation 108571. Up to 4630 conditions per place. [2022-12-05 22:41:26,309 INFO L137 encePairwiseOnDemand]: 8/49 looper letters, 706 selfloop transitions, 658 changer transitions 1/1365 dead transitions. [2022-12-05 22:41:26,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1365 transitions, 45234 flow [2022-12-05 22:41:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-05 22:41:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-05 22:41:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 214 transitions. [2022-12-05 22:41:26,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14088215931533904 [2022-12-05 22:41:26,310 INFO L175 Difference]: Start difference. First operand has 430 places, 1111 transitions, 37446 flow. Second operand 31 states and 214 transitions. [2022-12-05 22:41:26,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1365 transitions, 45234 flow [2022-12-05 22:41:32,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 1365 transitions, 43810 flow, removed 648 selfloop flow, removed 13 redundant places. [2022-12-05 22:41:32,089 INFO L231 Difference]: Finished difference. Result has 458 places, 1193 transitions, 41359 flow [2022-12-05 22:41:32,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=36114, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=41359, PETRI_PLACES=458, PETRI_TRANSITIONS=1193} [2022-12-05 22:41:32,090 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 440 predicate places. [2022-12-05 22:41:32,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:32,090 INFO L89 Accepts]: Start accepts. Operand has 458 places, 1193 transitions, 41359 flow [2022-12-05 22:41:32,099 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:32,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:32,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 1193 transitions, 41359 flow [2022-12-05 22:41:32,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 1193 transitions, 41359 flow [2022-12-05 22:41:32,842 INFO L130 PetriNetUnfolder]: 945/2479 cut-off events. [2022-12-05 22:41:32,843 INFO L131 PetriNetUnfolder]: For 335887/336633 co-relation queries the response was YES. [2022-12-05 22:41:32,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41712 conditions, 2479 events. 945/2479 cut-off events. For 335887/336633 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 23204 event pairs, 4 based on Foata normal form. 46/2521 useless extension candidates. Maximal degree in co-relation 41542. Up to 1128 conditions per place. [2022-12-05 22:41:32,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 458 places, 1193 transitions, 41359 flow [2022-12-05 22:41:32,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 3544 [2022-12-05 22:41:32,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:41:32,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:41:33,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [396] L705-6-->L687-5: Formula: (and (< v_~p~0_218 5) (= (* 2 v_~next~0_149) (+ (* 21 v_~prev~0_291) (* 3 v_~prev~0_290) (* 34 v_~cur~0_241))) (= v_~p~0_217 (+ v_~p~0_218 1)) (= (* 5 v_~prev~0_290) (+ (* 21 v_~cur~0_241) (* 3 v_~next~0_149) (* v_~prev~0_291 13))) (= v_~next~0_149 v_~cur~0_240) (= v_~x~0_276 (+ 12 v_~x~0_277)) (< v_~x~0_277 1) (= (+ v_~j~0_403 v_~i~0_340) v_~i~0_339)) InVars {~j~0=v_~j~0_403, ~prev~0=v_~prev~0_291, ~i~0=v_~i~0_340, ~p~0=v_~p~0_218, ~cur~0=v_~cur~0_241, ~x~0=v_~x~0_277} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_175|, ~j~0=v_~j~0_403, ~next~0=v_~next~0_149, ~prev~0=v_~prev~0_290, ~i~0=v_~i~0_339, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_153|, ~p~0=v_~p~0_217, ~cur~0=v_~cur~0_240, ~x~0=v_~x~0_276} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:41:33,139 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:41:33,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1050 [2022-12-05 22:41:33,140 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 1192 transitions, 41392 flow [2022-12-05 22:41:33,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:33,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:33,140 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:33,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-05 22:41:33,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:33,343 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash -516696662, now seen corresponding path program 1 times [2022-12-05 22:41:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:33,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369899438] [2022-12-05 22:41:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:33,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369899438] [2022-12-05 22:41:33,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369899438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307893569] [2022-12-05 22:41:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:33,384 INFO L229 MonitoredProcess]: Starting monitored process 38 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:41:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-05 22:41:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:33,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:41:33,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:33,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:41:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307893569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:41:33,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:41:33,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-05 22:41:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470972931] [2022-12-05 22:41:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:41:33,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:41:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:41:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:41:33,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-05 22:41:33,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1192 transitions, 41392 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:41:33,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:33,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-05 22:41:33,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:36,871 INFO L130 PetriNetUnfolder]: 4592/7933 cut-off events. [2022-12-05 22:41:36,872 INFO L131 PetriNetUnfolder]: For 1001168/1001168 co-relation queries the response was YES. [2022-12-05 22:41:36,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111535 conditions, 7933 events. 4592/7933 cut-off events. For 1001168/1001168 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 60667 event pairs, 739 based on Foata normal form. 14/7939 useless extension candidates. Maximal degree in co-relation 111362. Up to 4199 conditions per place. [2022-12-05 22:41:36,967 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 1751 selfloop transitions, 6 changer transitions 71/1828 dead transitions. [2022-12-05 22:41:36,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1828 transitions, 67465 flow [2022-12-05 22:41:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:41:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:41:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-05 22:41:36,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3284313725490196 [2022-12-05 22:41:36,970 INFO L175 Difference]: Start difference. First operand has 457 places, 1192 transitions, 41392 flow. Second operand 4 states and 67 transitions. [2022-12-05 22:41:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1828 transitions, 67465 flow [2022-12-05 22:41:42,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 1828 transitions, 65763 flow, removed 747 selfloop flow, removed 10 redundant places. [2022-12-05 22:41:42,608 INFO L231 Difference]: Finished difference. Result has 452 places, 1181 transitions, 39904 flow [2022-12-05 22:41:42,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=39891, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=39904, PETRI_PLACES=452, PETRI_TRANSITIONS=1181} [2022-12-05 22:41:42,610 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 434 predicate places. [2022-12-05 22:41:42,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:42,611 INFO L89 Accepts]: Start accepts. Operand has 452 places, 1181 transitions, 39904 flow [2022-12-05 22:41:42,622 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:42,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:42,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 1181 transitions, 39904 flow [2022-12-05 22:41:42,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 451 places, 1181 transitions, 39904 flow [2022-12-05 22:41:43,376 INFO L130 PetriNetUnfolder]: 936/2468 cut-off events. [2022-12-05 22:41:43,376 INFO L131 PetriNetUnfolder]: For 340172/340798 co-relation queries the response was YES. [2022-12-05 22:41:43,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41627 conditions, 2468 events. 936/2468 cut-off events. For 340172/340798 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 23219 event pairs, 5 based on Foata normal form. 47/2511 useless extension candidates. Maximal degree in co-relation 41454. Up to 1121 conditions per place. [2022-12-05 22:41:43,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 1181 transitions, 39904 flow [2022-12-05 22:41:43,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 3526 [2022-12-05 22:41:43,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:41:43,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:41:43,564 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:41:43,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 954 [2022-12-05 22:41:43,565 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 1181 transitions, 39958 flow [2022-12-05 22:41:43,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:41:43,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:43,565 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:43,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:43,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-05 22:41:43,765 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 888933642, now seen corresponding path program 1 times [2022-12-05 22:41:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:43,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097512406] [2022-12-05 22:41:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097512406] [2022-12-05 22:41:43,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097512406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560282537] [2022-12-05 22:41:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:43,856 INFO L229 MonitoredProcess]: Starting monitored process 39 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:41:43,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-05 22:41:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:43,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:41:43,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:44,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:44,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560282537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:44,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:44,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:41:44,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714632843] [2022-12-05 22:41:44,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:44,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:41:44,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:44,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:41:44,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:41:44,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-05 22:41:44,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 1181 transitions, 39958 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:41:44,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:44,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-05 22:41:44,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:51,463 INFO L130 PetriNetUnfolder]: 4670/8113 cut-off events. [2022-12-05 22:41:51,463 INFO L131 PetriNetUnfolder]: For 1187598/1187598 co-relation queries the response was YES. [2022-12-05 22:41:51,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115184 conditions, 8113 events. 4670/8113 cut-off events. For 1187598/1187598 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 61852 event pairs, 747 based on Foata normal form. 62/8167 useless extension candidates. Maximal degree in co-relation 115008. Up to 6578 conditions per place. [2022-12-05 22:41:51,567 INFO L137 encePairwiseOnDemand]: 9/54 looper letters, 962 selfloop transitions, 373 changer transitions 12/1347 dead transitions. [2022-12-05 22:41:51,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1347 transitions, 45608 flow [2022-12-05 22:41:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:41:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:41:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-12-05 22:41:51,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12321937321937322 [2022-12-05 22:41:51,569 INFO L175 Difference]: Start difference. First operand has 451 places, 1181 transitions, 39958 flow. Second operand 26 states and 173 transitions. [2022-12-05 22:41:51,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1347 transitions, 45608 flow [2022-12-05 22:41:58,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 1347 transitions, 45555 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-05 22:41:58,436 INFO L231 Difference]: Finished difference. Result has 477 places, 1225 transitions, 42581 flow [2022-12-05 22:41:58,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=39909, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=42581, PETRI_PLACES=477, PETRI_TRANSITIONS=1225} [2022-12-05 22:41:58,437 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 459 predicate places. [2022-12-05 22:41:58,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:58,437 INFO L89 Accepts]: Start accepts. Operand has 477 places, 1225 transitions, 42581 flow [2022-12-05 22:41:58,444 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:58,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:58,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 477 places, 1225 transitions, 42581 flow [2022-12-05 22:41:58,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 1225 transitions, 42581 flow [2022-12-05 22:41:59,217 INFO L130 PetriNetUnfolder]: 956/2553 cut-off events. [2022-12-05 22:41:59,217 INFO L131 PetriNetUnfolder]: For 345514/346189 co-relation queries the response was YES. [2022-12-05 22:41:59,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43450 conditions, 2553 events. 956/2553 cut-off events. For 345514/346189 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 24332 event pairs, 4 based on Foata normal form. 52/2601 useless extension candidates. Maximal degree in co-relation 43272. Up to 1158 conditions per place. [2022-12-05 22:41:59,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 476 places, 1225 transitions, 42581 flow [2022-12-05 22:41:59,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 3632 [2022-12-05 22:41:59,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:41:59,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 902 [2022-12-05 22:41:59,339 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 1225 transitions, 42657 flow [2022-12-05 22:41:59,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 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:41:59,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:59,339 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:59,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:59,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-05 22:41:59,543 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 978025037, now seen corresponding path program 1 times [2022-12-05 22:41:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:59,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520288942] [2022-12-05 22:41:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:59,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:59,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520288942] [2022-12-05 22:41:59,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520288942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:59,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20474340] [2022-12-05 22:41:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:59,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:59,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:59,694 INFO L229 MonitoredProcess]: Starting monitored process 40 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:41:59,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-05 22:41:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:59,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:41:59,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:59,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:00,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20474340] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:00,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:00,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:42:00,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43710846] [2022-12-05 22:42:00,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:00,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:42:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:42:00,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:42:00,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-05 22:42:00,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 1225 transitions, 42657 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:00,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:00,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-05 22:42:00,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:03,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:08,885 INFO L130 PetriNetUnfolder]: 4754/8287 cut-off events. [2022-12-05 22:42:08,885 INFO L131 PetriNetUnfolder]: For 1100370/1100370 co-relation queries the response was YES. [2022-12-05 22:42:08,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119917 conditions, 8287 events. 4754/8287 cut-off events. For 1100370/1100370 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 63667 event pairs, 741 based on Foata normal form. 20/8299 useless extension candidates. Maximal degree in co-relation 119736. Up to 6115 conditions per place. [2022-12-05 22:42:08,992 INFO L137 encePairwiseOnDemand]: 9/55 looper letters, 902 selfloop transitions, 512 changer transitions 6/1420 dead transitions. [2022-12-05 22:42:08,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1420 transitions, 49020 flow [2022-12-05 22:42:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-05 22:42:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-05 22:42:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 199 transitions. [2022-12-05 22:42:08,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1206060606060606 [2022-12-05 22:42:08,993 INFO L175 Difference]: Start difference. First operand has 476 places, 1225 transitions, 42657 flow. Second operand 30 states and 199 transitions. [2022-12-05 22:42:08,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 1420 transitions, 49020 flow [2022-12-05 22:42:17,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 1420 transitions, 48546 flow, removed 174 selfloop flow, removed 12 redundant places. [2022-12-05 22:42:17,215 INFO L231 Difference]: Finished difference. Result has 498 places, 1264 transitions, 45278 flow [2022-12-05 22:42:17,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=42185, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=45278, PETRI_PLACES=498, PETRI_TRANSITIONS=1264} [2022-12-05 22:42:17,215 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 480 predicate places. [2022-12-05 22:42:17,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:17,216 INFO L89 Accepts]: Start accepts. Operand has 498 places, 1264 transitions, 45278 flow [2022-12-05 22:42:17,224 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:17,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:17,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 498 places, 1264 transitions, 45278 flow [2022-12-05 22:42:17,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 498 places, 1264 transitions, 45278 flow [2022-12-05 22:42:17,987 INFO L130 PetriNetUnfolder]: 976/2625 cut-off events. [2022-12-05 22:42:17,987 INFO L131 PetriNetUnfolder]: For 366794/367574 co-relation queries the response was YES. [2022-12-05 22:42:18,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45489 conditions, 2625 events. 976/2625 cut-off events. For 366794/367574 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 25266 event pairs, 4 based on Foata normal form. 53/2674 useless extension candidates. Maximal degree in co-relation 45306. Up to 1204 conditions per place. [2022-12-05 22:42:18,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 498 places, 1264 transitions, 45278 flow [2022-12-05 22:42:18,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 3716 [2022-12-05 22:42:18,207 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:42:18,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 992 [2022-12-05 22:42:18,208 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 1262 transitions, 45242 flow [2022-12-05 22:42:18,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:18,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:18,208 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:18,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-05 22:42:18,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:18,412 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 994737788, now seen corresponding path program 1 times [2022-12-05 22:42:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:18,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064850747] [2022-12-05 22:42:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:18,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064850747] [2022-12-05 22:42:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064850747] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:18,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557600889] [2022-12-05 22:42:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:18,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:18,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:18,513 INFO L229 MonitoredProcess]: Starting monitored process 41 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:42:18,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-05 22:42:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:18,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:42:18,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:18,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:18,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557600889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:18,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:18,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:42:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092094462] [2022-12-05 22:42:18,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:18,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:42:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:42:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:42:18,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-05 22:42:18,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 1262 transitions, 45242 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:18,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:18,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-05 22:42:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:28,068 INFO L130 PetriNetUnfolder]: 5050/8853 cut-off events. [2022-12-05 22:42:28,068 INFO L131 PetriNetUnfolder]: For 1312844/1312844 co-relation queries the response was YES. [2022-12-05 22:42:28,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130114 conditions, 8853 events. 5050/8853 cut-off events. For 1312844/1312844 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 69179 event pairs, 556 based on Foata normal form. 48/8893 useless extension candidates. Maximal degree in co-relation 129928. Up to 5725 conditions per place. [2022-12-05 22:42:28,185 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 811 selfloop transitions, 715 changer transitions 4/1530 dead transitions. [2022-12-05 22:42:28,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 1530 transitions, 54425 flow [2022-12-05 22:42:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:42:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:42:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 209 transitions. [2022-12-05 22:42:28,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11875 [2022-12-05 22:42:28,187 INFO L175 Difference]: Start difference. First operand has 496 places, 1262 transitions, 45242 flow. Second operand 32 states and 209 transitions. [2022-12-05 22:42:28,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 1530 transitions, 54425 flow [2022-12-05 22:42:37,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 1530 transitions, 53731 flow, removed 284 selfloop flow, removed 11 redundant places. [2022-12-05 22:42:37,891 INFO L231 Difference]: Finished difference. Result has 523 places, 1372 transitions, 51172 flow [2022-12-05 22:42:37,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=44566, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=51172, PETRI_PLACES=523, PETRI_TRANSITIONS=1372} [2022-12-05 22:42:37,892 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 505 predicate places. [2022-12-05 22:42:37,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:37,892 INFO L89 Accepts]: Start accepts. Operand has 523 places, 1372 transitions, 51172 flow [2022-12-05 22:42:37,901 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:37,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:37,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 523 places, 1372 transitions, 51172 flow [2022-12-05 22:42:37,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 523 places, 1372 transitions, 51172 flow [2022-12-05 22:42:38,825 INFO L130 PetriNetUnfolder]: 1051/2853 cut-off events. [2022-12-05 22:42:38,825 INFO L131 PetriNetUnfolder]: For 405636/406327 co-relation queries the response was YES. [2022-12-05 22:42:38,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50592 conditions, 2853 events. 1051/2853 cut-off events. For 405636/406327 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 27929 event pairs, 4 based on Foata normal form. 43/2892 useless extension candidates. Maximal degree in co-relation 50402. Up to 1351 conditions per place. [2022-12-05 22:42:38,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 523 places, 1372 transitions, 51172 flow [2022-12-05 22:42:38,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 3974 [2022-12-05 22:42:39,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:42:39,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1168 [2022-12-05 22:42:39,060 INFO L495 AbstractCegarLoop]: Abstraction has has 523 places, 1372 transitions, 51197 flow [2022-12-05 22:42:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:39,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:39,061 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:39,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-05 22:42:39,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-05 22:42:39,265 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 343101389, now seen corresponding path program 1 times [2022-12-05 22:42:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601716925] [2022-12-05 22:42:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:39,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:39,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601716925] [2022-12-05 22:42:39,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601716925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:39,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077735995] [2022-12-05 22:42:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:39,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:39,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:39,379 INFO L229 MonitoredProcess]: Starting monitored process 42 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:42:39,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-05 22:42:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:39,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:42:39,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:39,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:39,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077735995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:39,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:42:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546887915] [2022-12-05 22:42:39,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:42:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:42:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:42:39,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-05 22:42:39,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 1372 transitions, 51197 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:39,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:39,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-05 22:42:39,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:45,946 INFO L130 PetriNetUnfolder]: 5255/9256 cut-off events. [2022-12-05 22:42:45,947 INFO L131 PetriNetUnfolder]: For 1548693/1548693 co-relation queries the response was YES. [2022-12-05 22:42:46,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138919 conditions, 9256 events. 5255/9256 cut-off events. For 1548693/1548693 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 73253 event pairs, 1053 based on Foata normal form. 76/9324 useless extension candidates. Maximal degree in co-relation 138726. Up to 7442 conditions per place. [2022-12-05 22:42:46,067 INFO L137 encePairwiseOnDemand]: 16/56 looper letters, 1110 selfloop transitions, 455 changer transitions 8/1573 dead transitions. [2022-12-05 22:42:46,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 1573 transitions, 59343 flow [2022-12-05 22:42:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-05 22:42:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-05 22:42:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 173 transitions. [2022-12-05 22:42:46,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11033163265306123 [2022-12-05 22:42:46,068 INFO L175 Difference]: Start difference. First operand has 523 places, 1372 transitions, 51197 flow. Second operand 28 states and 173 transitions. [2022-12-05 22:42:46,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 1573 transitions, 59343 flow [2022-12-05 22:42:57,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 1573 transitions, 57818 flow, removed 599 selfloop flow, removed 16 redundant places. [2022-12-05 22:42:57,697 INFO L231 Difference]: Finished difference. Result has 540 places, 1461 transitions, 54937 flow [2022-12-05 22:42:57,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=49774, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=54937, PETRI_PLACES=540, PETRI_TRANSITIONS=1461} [2022-12-05 22:42:57,698 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 522 predicate places. [2022-12-05 22:42:57,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:57,698 INFO L89 Accepts]: Start accepts. Operand has 540 places, 1461 transitions, 54937 flow [2022-12-05 22:42:57,706 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:57,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:57,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 540 places, 1461 transitions, 54937 flow [2022-12-05 22:42:57,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 540 places, 1461 transitions, 54937 flow [2022-12-05 22:42:58,834 INFO L130 PetriNetUnfolder]: 1109/3015 cut-off events. [2022-12-05 22:42:58,834 INFO L131 PetriNetUnfolder]: For 431959/432714 co-relation queries the response was YES. [2022-12-05 22:42:58,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53546 conditions, 3015 events. 1109/3015 cut-off events. For 431959/432714 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 29886 event pairs, 6 based on Foata normal form. 42/3053 useless extension candidates. Maximal degree in co-relation 53351. Up to 1369 conditions per place. [2022-12-05 22:42:58,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 540 places, 1461 transitions, 54937 flow [2022-12-05 22:42:58,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 4182 [2022-12-05 22:42:59,048 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:42:59,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1350 [2022-12-05 22:42:59,049 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 1461 transitions, 55101 flow [2022-12-05 22:42:59,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:59,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:59,049 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:59,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-05 22:42:59,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:59,249 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:59,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash 336445503, now seen corresponding path program 1 times [2022-12-05 22:42:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921692632] [2022-12-05 22:42:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:59,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:59,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921692632] [2022-12-05 22:42:59,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921692632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:59,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100264968] [2022-12-05 22:42:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:59,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:59,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:59,349 INFO L229 MonitoredProcess]: Starting monitored process 43 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:42:59,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-05 22:42:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:59,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:42:59,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:59,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:59,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100264968] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:59,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:59,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:42:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199765888] [2022-12-05 22:42:59,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:59,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:42:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:42:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:42:59,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-05 22:42:59,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 1461 transitions, 55101 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:59,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:59,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-05 22:42:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:18,039 INFO L130 PetriNetUnfolder]: 5373/9514 cut-off events. [2022-12-05 22:43:18,039 INFO L131 PetriNetUnfolder]: For 1635541/1635541 co-relation queries the response was YES. [2022-12-05 22:43:18,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143879 conditions, 9514 events. 5373/9514 cut-off events. For 1635541/1635541 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 76265 event pairs, 820 based on Foata normal form. 66/9572 useless extension candidates. Maximal degree in co-relation 143681. Up to 7191 conditions per place. [2022-12-05 22:43:18,165 INFO L137 encePairwiseOnDemand]: 9/60 looper letters, 1104 selfloop transitions, 574 changer transitions 14/1692 dead transitions. [2022-12-05 22:43:18,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 1692 transitions, 63030 flow [2022-12-05 22:43:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-05 22:43:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-05 22:43:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 222 transitions. [2022-12-05 22:43:18,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10277777777777777 [2022-12-05 22:43:18,166 INFO L175 Difference]: Start difference. First operand has 540 places, 1461 transitions, 55101 flow. Second operand 36 states and 222 transitions. [2022-12-05 22:43:18,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 1692 transitions, 63030 flow [2022-12-05 22:43:29,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 1692 transitions, 61282 flow, removed 764 selfloop flow, removed 12 redundant places. [2022-12-05 22:43:29,628 INFO L231 Difference]: Finished difference. Result has 570 places, 1514 transitions, 57554 flow [2022-12-05 22:43:29,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=53575, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=528, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=57554, PETRI_PLACES=570, PETRI_TRANSITIONS=1514} [2022-12-05 22:43:29,629 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 552 predicate places. [2022-12-05 22:43:29,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:29,630 INFO L89 Accepts]: Start accepts. Operand has 570 places, 1514 transitions, 57554 flow [2022-12-05 22:43:29,639 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:29,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:29,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 570 places, 1514 transitions, 57554 flow [2022-12-05 22:43:29,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 570 places, 1514 transitions, 57554 flow [2022-12-05 22:43:30,787 INFO L130 PetriNetUnfolder]: 1130/3115 cut-off events. [2022-12-05 22:43:30,787 INFO L131 PetriNetUnfolder]: For 466590/467408 co-relation queries the response was YES. [2022-12-05 22:43:30,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55891 conditions, 3115 events. 1130/3115 cut-off events. For 466590/467408 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 31330 event pairs, 7 based on Foata normal form. 42/3153 useless extension candidates. Maximal degree in co-relation 55690. Up to 1386 conditions per place. [2022-12-05 22:43:30,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 570 places, 1514 transitions, 57554 flow [2022-12-05 22:43:30,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 4300 [2022-12-05 22:43:30,943 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:43:30,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1315 [2022-12-05 22:43:30,944 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 1513 transitions, 57529 flow [2022-12-05 22:43:30,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:30,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:30,944 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:30,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-05 22:43:31,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:31,144 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:43:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 196172177, now seen corresponding path program 1 times [2022-12-05 22:43:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078011768] [2022-12-05 22:43:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:43:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078011768] [2022-12-05 22:43:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078011768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514950417] [2022-12-05 22:43:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:31,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:31,192 INFO L229 MonitoredProcess]: Starting monitored process 44 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:43:31,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-05 22:43:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:31,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:43:31,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:43:31,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:43:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514950417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:43:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:43:31,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-05 22:43:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404498481] [2022-12-05 22:43:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:43:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:43:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:43:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:43:31,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-05 22:43:31,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 1513 transitions, 57529 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:43:31,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:31,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-05 22:43:31,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:36,762 INFO L130 PetriNetUnfolder]: 5990/10388 cut-off events. [2022-12-05 22:43:36,762 INFO L131 PetriNetUnfolder]: For 1491336/1491336 co-relation queries the response was YES. [2022-12-05 22:43:36,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159933 conditions, 10388 events. 5990/10388 cut-off events. For 1491336/1491336 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 82702 event pairs, 1282 based on Foata normal form. 6/10386 useless extension candidates. Maximal degree in co-relation 159729. Up to 7502 conditions per place. [2022-12-05 22:43:36,912 INFO L137 encePairwiseOnDemand]: 40/62 looper letters, 1979 selfloop transitions, 19 changer transitions 77/2075 dead transitions. [2022-12-05 22:43:36,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 2075 transitions, 82483 flow [2022-12-05 22:43:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:43:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:43:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 22:43:36,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2022-12-05 22:43:36,913 INFO L175 Difference]: Start difference. First operand has 569 places, 1513 transitions, 57529 flow. Second operand 4 states and 72 transitions. [2022-12-05 22:43:36,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 2075 transitions, 82483 flow [2022-12-05 22:43:50,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 2075 transitions, 81613 flow, removed 378 selfloop flow, removed 10 redundant places. [2022-12-05 22:43:50,439 INFO L231 Difference]: Finished difference. Result has 561 places, 1503 transitions, 56352 flow [2022-12-05 22:43:50,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=56276, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56352, PETRI_PLACES=561, PETRI_TRANSITIONS=1503} [2022-12-05 22:43:50,440 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 543 predicate places. [2022-12-05 22:43:50,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:50,440 INFO L89 Accepts]: Start accepts. Operand has 561 places, 1503 transitions, 56352 flow [2022-12-05 22:43:50,451 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:50,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:50,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 561 places, 1503 transitions, 56352 flow [2022-12-05 22:43:50,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 561 places, 1503 transitions, 56352 flow [2022-12-05 22:43:51,751 INFO L130 PetriNetUnfolder]: 1320/3486 cut-off events. [2022-12-05 22:43:51,751 INFO L131 PetriNetUnfolder]: For 557733/558564 co-relation queries the response was YES. [2022-12-05 22:43:51,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63644 conditions, 3486 events. 1320/3486 cut-off events. For 557733/558564 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 34804 event pairs, 7 based on Foata normal form. 42/3525 useless extension candidates. Maximal degree in co-relation 63441. Up to 1592 conditions per place. [2022-12-05 22:43:51,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 561 places, 1503 transitions, 56352 flow [2022-12-05 22:43:51,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 4538 [2022-12-05 22:43:51,845 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:43:51,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1406 [2022-12-05 22:43:51,846 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 1503 transitions, 56352 flow [2022-12-05 22:43:51,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:43:51,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:51,846 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:51,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-05 22:43:52,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-05 22:43:52,050 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:43:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1845794786, now seen corresponding path program 1 times [2022-12-05 22:43:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:52,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393512634] [2022-12-05 22:43:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:43:52,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:52,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393512634] [2022-12-05 22:43:52,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393512634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:43:52,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:43:52,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:43:52,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724324473] [2022-12-05 22:43:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:43:52,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:43:52,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:52,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:43:52,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:43:52,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-05 22:43:52,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1503 transitions, 56352 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:43:52,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:52,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-05 22:43:52,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:58,123 INFO L130 PetriNetUnfolder]: 6012/10426 cut-off events. [2022-12-05 22:43:58,123 INFO L131 PetriNetUnfolder]: For 1554065/1554065 co-relation queries the response was YES. [2022-12-05 22:43:58,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162998 conditions, 10426 events. 6012/10426 cut-off events. For 1554065/1554065 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 84034 event pairs, 589 based on Foata normal form. 18/10442 useless extension candidates. Maximal degree in co-relation 162792. Up to 5156 conditions per place. [2022-12-05 22:43:58,275 INFO L137 encePairwiseOnDemand]: 35/59 looper letters, 2086 selfloop transitions, 85 changer transitions 115/2286 dead transitions. [2022-12-05 22:43:58,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 2286 transitions, 89998 flow [2022-12-05 22:43:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:43:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:43:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-05 22:43:58,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3050847457627119 [2022-12-05 22:43:58,283 INFO L175 Difference]: Start difference. First operand has 561 places, 1503 transitions, 56352 flow. Second operand 5 states and 90 transitions. [2022-12-05 22:43:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 2286 transitions, 89998 flow [2022-12-05 22:44:10,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 2286 transitions, 89997 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:44:10,304 INFO L231 Difference]: Finished difference. Result has 566 places, 1503 transitions, 56591 flow [2022-12-05 22:44:10,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=56081, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56591, PETRI_PLACES=566, PETRI_TRANSITIONS=1503} [2022-12-05 22:44:10,305 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 548 predicate places. [2022-12-05 22:44:10,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:10,305 INFO L89 Accepts]: Start accepts. Operand has 566 places, 1503 transitions, 56591 flow [2022-12-05 22:44:10,316 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:10,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:10,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 566 places, 1503 transitions, 56591 flow [2022-12-05 22:44:10,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 1503 transitions, 56591 flow [2022-12-05 22:44:11,533 INFO L130 PetriNetUnfolder]: 1321/3503 cut-off events. [2022-12-05 22:44:11,533 INFO L131 PetriNetUnfolder]: For 579312/580164 co-relation queries the response was YES. [2022-12-05 22:44:11,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64820 conditions, 3503 events. 1321/3503 cut-off events. For 579312/580164 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 35087 event pairs, 7 based on Foata normal form. 55/3555 useless extension candidates. Maximal degree in co-relation 64614. Up to 1600 conditions per place. [2022-12-05 22:44:11,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 566 places, 1503 transitions, 56591 flow [2022-12-05 22:44:11,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 4560 [2022-12-05 22:44:11,631 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:44:11,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1327 [2022-12-05 22:44:11,632 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 1503 transitions, 56591 flow [2022-12-05 22:44:11,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:44:11,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:11,632 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:11,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-05 22:44:11,632 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:44:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1845795344, now seen corresponding path program 2 times [2022-12-05 22:44:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:11,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586889711] [2022-12-05 22:44:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586889711] [2022-12-05 22:44:11,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586889711] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173597962] [2022-12-05 22:44:11,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:44:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:11,731 INFO L229 MonitoredProcess]: Starting monitored process 45 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:44:11,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-05 22:44:11,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:44:11,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:44:11,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:44:11,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:11,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:12,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173597962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:12,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:12,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:44:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549356866] [2022-12-05 22:44:12,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:12,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:44:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:44:12,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:44:12,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-05 22:44:12,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 1503 transitions, 56591 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:12,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:12,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-05 22:44:12,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:25,374 INFO L130 PetriNetUnfolder]: 6110/10654 cut-off events. [2022-12-05 22:44:25,375 INFO L131 PetriNetUnfolder]: For 1647710/1647710 co-relation queries the response was YES. [2022-12-05 22:44:25,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169504 conditions, 10654 events. 6110/10654 cut-off events. For 1647710/1647710 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 85128 event pairs, 1143 based on Foata normal form. 16/10668 useless extension candidates. Maximal degree in co-relation 169295. Up to 8700 conditions per place. [2022-12-05 22:44:25,530 INFO L137 encePairwiseOnDemand]: 13/59 looper letters, 1190 selfloop transitions, 509 changer transitions 21/1720 dead transitions. [2022-12-05 22:44:25,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 1720 transitions, 64824 flow [2022-12-05 22:44:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-05 22:44:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-05 22:44:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 209 transitions. [2022-12-05 22:44:25,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09839924670433145 [2022-12-05 22:44:25,532 INFO L175 Difference]: Start difference. First operand has 566 places, 1503 transitions, 56591 flow. Second operand 36 states and 209 transitions. [2022-12-05 22:44:25,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 1720 transitions, 64824 flow [2022-12-05 22:44:39,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 1720 transitions, 64673 flow, removed 55 selfloop flow, removed 1 redundant places. [2022-12-05 22:44:39,551 INFO L231 Difference]: Finished difference. Result has 605 places, 1560 transitions, 60483 flow [2022-12-05 22:44:39,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=56496, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=459, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=60483, PETRI_PLACES=605, PETRI_TRANSITIONS=1560} [2022-12-05 22:44:39,553 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 587 predicate places. [2022-12-05 22:44:39,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:39,553 INFO L89 Accepts]: Start accepts. Operand has 605 places, 1560 transitions, 60483 flow [2022-12-05 22:44:39,563 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:39,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:39,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 605 places, 1560 transitions, 60483 flow [2022-12-05 22:44:39,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 605 places, 1560 transitions, 60483 flow [2022-12-05 22:44:41,040 INFO L130 PetriNetUnfolder]: 1362/3601 cut-off events. [2022-12-05 22:44:41,041 INFO L131 PetriNetUnfolder]: For 620553/621431 co-relation queries the response was YES. [2022-12-05 22:44:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68081 conditions, 3601 events. 1362/3601 cut-off events. For 620553/621431 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 36169 event pairs, 7 based on Foata normal form. 57/3655 useless extension candidates. Maximal degree in co-relation 67869. Up to 1670 conditions per place. [2022-12-05 22:44:41,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 605 places, 1560 transitions, 60483 flow [2022-12-05 22:44:41,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 4654 [2022-12-05 22:44:41,377 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:44:41,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1824 [2022-12-05 22:44:41,378 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 1559 transitions, 60514 flow [2022-12-05 22:44:41,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:41,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:41,378 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:41,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-05 22:44:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-05 22:44:41,582 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:44:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1699810521, now seen corresponding path program 1 times [2022-12-05 22:44:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:41,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924534418] [2022-12-05 22:44:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:41,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924534418] [2022-12-05 22:44:41,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924534418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:41,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496293312] [2022-12-05 22:44:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:41,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:41,624 INFO L229 MonitoredProcess]: Starting monitored process 46 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:44:41,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-05 22:44:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:41,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:44:41,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:41,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:44:41,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496293312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:44:41,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:44:41,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-12-05 22:44:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369124880] [2022-12-05 22:44:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:44:41,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:44:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:44:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:44:41,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:44:41,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 1559 transitions, 60514 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:44:41,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:41,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:44:41,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:47,937 INFO L130 PetriNetUnfolder]: 6093/10677 cut-off events. [2022-12-05 22:44:47,937 INFO L131 PetriNetUnfolder]: For 1770049/1770049 co-relation queries the response was YES. [2022-12-05 22:44:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172882 conditions, 10677 events. 6093/10677 cut-off events. For 1770049/1770049 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 86873 event pairs, 851 based on Foata normal form. 190/10865 useless extension candidates. Maximal degree in co-relation 172667. Up to 5776 conditions per place. [2022-12-05 22:44:48,091 INFO L137 encePairwiseOnDemand]: 46/61 looper letters, 2077 selfloop transitions, 180 changer transitions 135/2392 dead transitions. [2022-12-05 22:44:48,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 2392 transitions, 97822 flow [2022-12-05 22:44:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:44:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:44:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-05 22:44:48,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25956284153005466 [2022-12-05 22:44:48,092 INFO L175 Difference]: Start difference. First operand has 604 places, 1559 transitions, 60514 flow. Second operand 6 states and 95 transitions. [2022-12-05 22:44:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 2392 transitions, 97822 flow [2022-12-05 22:45:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 2392 transitions, 96255 flow, removed 643 selfloop flow, removed 21 redundant places. [2022-12-05 22:45:00,382 INFO L231 Difference]: Finished difference. Result has 591 places, 1557 transitions, 60478 flow [2022-12-05 22:45:00,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=57457, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60478, PETRI_PLACES=591, PETRI_TRANSITIONS=1557} [2022-12-05 22:45:00,383 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 573 predicate places. [2022-12-05 22:45:00,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:00,383 INFO L89 Accepts]: Start accepts. Operand has 591 places, 1557 transitions, 60478 flow [2022-12-05 22:45:00,394 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:00,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:00,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 591 places, 1557 transitions, 60478 flow [2022-12-05 22:45:00,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 590 places, 1557 transitions, 60478 flow [2022-12-05 22:45:01,672 INFO L130 PetriNetUnfolder]: 1305/3568 cut-off events. [2022-12-05 22:45:01,672 INFO L131 PetriNetUnfolder]: For 668290/669232 co-relation queries the response was YES. [2022-12-05 22:45:01,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68636 conditions, 3568 events. 1305/3568 cut-off events. For 668290/669232 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 36369 event pairs, 6 based on Foata normal form. 93/3658 useless extension candidates. Maximal degree in co-relation 68422. Up to 1613 conditions per place. [2022-12-05 22:45:01,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 590 places, 1557 transitions, 60478 flow [2022-12-05 22:45:01,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 4754 [2022-12-05 22:45:01,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:45:01,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1437 [2022-12-05 22:45:01,820 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 1557 transitions, 60494 flow [2022-12-05 22:45:01,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:45:01,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:01,821 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:01,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-05 22:45:02,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-05 22:45:02,026 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:45:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1848702369, now seen corresponding path program 1 times [2022-12-05 22:45:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:02,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780664850] [2022-12-05 22:45:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780664850] [2022-12-05 22:45:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780664850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144545138] [2022-12-05 22:45:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:02,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:02,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:02,233 INFO L229 MonitoredProcess]: Starting monitored process 47 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:45:02,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-05 22:45:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:02,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:45:02,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:02,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:45:02,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144545138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:45:02,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:45:02,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:45:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845212020] [2022-12-05 22:45:02,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:45:02,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:45:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:45:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:45:02,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-05 22:45:02,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 1557 transitions, 60494 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:45:02,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:02,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-05 22:45:02,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:08,474 INFO L130 PetriNetUnfolder]: 6028/10556 cut-off events. [2022-12-05 22:45:08,474 INFO L131 PetriNetUnfolder]: For 1765778/1765778 co-relation queries the response was YES. [2022-12-05 22:45:08,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173607 conditions, 10556 events. 6028/10556 cut-off events. For 1765778/1765778 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 86200 event pairs, 594 based on Foata normal form. 10/10561 useless extension candidates. Maximal degree in co-relation 173390. Up to 5219 conditions per place. [2022-12-05 22:45:08,703 INFO L137 encePairwiseOnDemand]: 43/62 looper letters, 2125 selfloop transitions, 47 changer transitions 157/2329 dead transitions. [2022-12-05 22:45:08,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 2329 transitions, 95524 flow [2022-12-05 22:45:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:45:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:45:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-05 22:45:08,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30376344086021506 [2022-12-05 22:45:08,704 INFO L175 Difference]: Start difference. First operand has 590 places, 1557 transitions, 60494 flow. Second operand 6 states and 113 transitions. [2022-12-05 22:45:08,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 2329 transitions, 95524 flow [2022-12-05 22:45:20,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 2329 transitions, 93942 flow, removed 748 selfloop flow, removed 3 redundant places. [2022-12-05 22:45:20,980 INFO L231 Difference]: Finished difference. Result has 594 places, 1536 transitions, 59001 flow [2022-12-05 22:45:20,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=59180, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=59001, PETRI_PLACES=594, PETRI_TRANSITIONS=1536} [2022-12-05 22:45:20,982 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 576 predicate places. [2022-12-05 22:45:20,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:20,982 INFO L89 Accepts]: Start accepts. Operand has 594 places, 1536 transitions, 59001 flow [2022-12-05 22:45:20,990 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:20,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:20,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 594 places, 1536 transitions, 59001 flow [2022-12-05 22:45:21,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 591 places, 1536 transitions, 59001 flow [2022-12-05 22:45:22,347 INFO L130 PetriNetUnfolder]: 1292/3519 cut-off events. [2022-12-05 22:45:22,348 INFO L131 PetriNetUnfolder]: For 646631/647448 co-relation queries the response was YES. [2022-12-05 22:45:22,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67637 conditions, 3519 events. 1292/3519 cut-off events. For 646631/647448 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 35697 event pairs, 6 based on Foata normal form. 74/3590 useless extension candidates. Maximal degree in co-relation 67421. Up to 1592 conditions per place. [2022-12-05 22:45:22,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 591 places, 1536 transitions, 59001 flow [2022-12-05 22:45:22,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 4716 [2022-12-05 22:45:22,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:45:22,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L705-6-->L695-5: Formula: (and (= (* 5 v_~prev~0_276) (+ (* 21 v_~cur~0_230) (* v_~prev~0_277 13) (* 3 v_~next~0_142))) (= v_~j~0_359 (+ v_~j~0_361 (* v_~i~0_301 4))) (= (+ 12 v_~x~0_263) v_~x~0_262) (= v_~next~0_142 v_~cur~0_229) (< v_~q~0_258 2) (< v_~x~0_263 1) (= v_~q~0_256 (+ v_~q~0_258 4)) (= (+ (* 3 v_~prev~0_276) (* 21 v_~prev~0_277) (* 34 v_~cur~0_230)) (* 2 v_~next~0_142))) InVars {~j~0=v_~j~0_361, ~prev~0=v_~prev~0_277, ~i~0=v_~i~0_301, ~q~0=v_~q~0_258, ~cur~0=v_~cur~0_230, ~x~0=v_~x~0_263} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_165|, ~j~0=v_~j~0_359, ~next~0=v_~next~0_142, ~prev~0=v_~prev~0_276, ~i~0=v_~i~0_301, ~q~0=v_~q~0_256, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_180|, ~cur~0=v_~cur~0_229, ~x~0=v_~x~0_262} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [418] L687-5-->L695-5: Formula: (and (= v_~j~0_513 (+ v_~j~0_514 v_~i~0_455)) (= v_~p~0_305 (+ v_~p~0_306 1)) (= v_~q~0_384 (+ v_~q~0_385 1)) (< v_~p~0_306 5) (< v_~q~0_385 5) (= (+ v_~j~0_514 v_~i~0_456) v_~i~0_455)) InVars {~j~0=v_~j~0_514, ~i~0=v_~i~0_456, ~q~0=v_~q~0_385, ~p~0=v_~p~0_306} OutVars{~j~0=v_~j~0_513, ~i~0=v_~i~0_455, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_215|, ~q~0=v_~q~0_384, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_267|, ~p~0=v_~p~0_305} AuxVars[] AssignedVars[~j~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0] [2022-12-05 22:45:22,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L705-6-->L695-5: Formula: (and (= (* 5 v_~prev~0_276) (+ (* 21 v_~cur~0_230) (* v_~prev~0_277 13) (* 3 v_~next~0_142))) (= v_~j~0_359 (+ v_~j~0_361 (* v_~i~0_301 4))) (= (+ 12 v_~x~0_263) v_~x~0_262) (= v_~next~0_142 v_~cur~0_229) (< v_~q~0_258 2) (< v_~x~0_263 1) (= v_~q~0_256 (+ v_~q~0_258 4)) (= (+ (* 3 v_~prev~0_276) (* 21 v_~prev~0_277) (* 34 v_~cur~0_230)) (* 2 v_~next~0_142))) InVars {~j~0=v_~j~0_361, ~prev~0=v_~prev~0_277, ~i~0=v_~i~0_301, ~q~0=v_~q~0_258, ~cur~0=v_~cur~0_230, ~x~0=v_~x~0_263} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_165|, ~j~0=v_~j~0_359, ~next~0=v_~next~0_142, ~prev~0=v_~prev~0_276, ~i~0=v_~i~0_301, ~q~0=v_~q~0_256, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_180|, ~cur~0=v_~cur~0_229, ~x~0=v_~x~0_262} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [395] L687-5-->L687-5: Formula: (and (< v_~p~0_207 6) (= v_~p~0_207 (+ v_~p~0_209 2)) (= v_~i~0_327 (+ v_~i~0_329 (* v_~j~0_399 2)))) InVars {~j~0=v_~j~0_399, ~i~0=v_~i~0_329, ~p~0=v_~p~0_209} OutVars{~j~0=v_~j~0_399, ~i~0=v_~i~0_327, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_145|, ~p~0=v_~p~0_207} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:45:22,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L705-6-->L687-5: Formula: (and (= v_~next~0_175 v_~cur~0_286) (= (* 5 v_~prev~0_342) (+ (* 21 v_~cur~0_287) (* 3 v_~next~0_175) (* v_~prev~0_343 13))) (= (+ 12 v_~x~0_329) v_~x~0_328) (= v_~j~0_523 (+ v_~j~0_524 (* v_~i~0_464 4))) (= (* 2 v_~next~0_175) (+ (* 21 v_~prev~0_343) (* 34 v_~cur~0_287) (* 3 v_~prev~0_342))) (= v_~p~0_313 (+ v_~p~0_314 2)) (< v_~p~0_313 6) (< v_~q~0_395 2) (= (+ (* v_~j~0_523 2) v_~i~0_464) v_~i~0_463) (< v_~x~0_329 1) (= (+ v_~q~0_395 4) v_~q~0_394)) InVars {~j~0=v_~j~0_524, ~prev~0=v_~prev~0_343, ~i~0=v_~i~0_464, ~q~0=v_~q~0_395, ~p~0=v_~p~0_314, ~cur~0=v_~cur~0_287, ~x~0=v_~x~0_329} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_207|, ~j~0=v_~j~0_523, ~next~0=v_~next~0_175, ~prev~0=v_~prev~0_342, ~i~0=v_~i~0_463, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_219|, ~q~0=v_~q~0_394, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_273|, ~p~0=v_~p~0_313, ~cur~0=v_~cur~0_286, ~x~0=v_~x~0_328} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:45:22,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L687-5-->L687-5: Formula: (and (= (+ v_~p~0_126 3) v_~p~0_124) (= v_~i~0_219 (+ (* v_~j~0_275 3) v_~i~0_221)) (< v_~p~0_126 3)) InVars {~j~0=v_~j~0_275, ~i~0=v_~i~0_221, ~p~0=v_~p~0_126} OutVars{~j~0=v_~j~0_275, ~i~0=v_~i~0_219, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_87|, ~p~0=v_~p~0_124} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:45:23,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L687-5-->t1EXIT: Formula: (and (= v_~i~0_467 (+ (* v_~j~0_527 3) v_~i~0_468)) (< v_~p~0_318 3) (not (< v_~p~0_317 5)) (= |v_t1Thread1of1ForFork1_#res.offset_45| 0) (= |v_t1Thread1of1ForFork1_#res.base_45| 0) (= v_~p~0_317 (+ v_~p~0_318 3))) InVars {~j~0=v_~j~0_527, ~i~0=v_~i~0_468, ~p~0=v_~p~0_318} OutVars{~j~0=v_~j~0_527, ~i~0=v_~i~0_467, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_221|, t1Thread1of1ForFork1_#res.base=|v_t1Thread1of1ForFork1_#res.base_45|, ~p~0=v_~p~0_317, t1Thread1of1ForFork1_#res.offset=|v_t1Thread1of1ForFork1_#res.offset_45|} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, t1Thread1of1ForFork1_#res.base, ~p~0, t1Thread1of1ForFork1_#res.offset] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:45:23,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [419] L705-6-->L695-5: Formula: (and (= (+ (* 34 v_~cur~0_283) (* 21 v_~prev~0_339) (* 3 v_~prev~0_338)) (* 2 v_~next~0_173)) (= v_~j~0_517 (+ v_~j~0_519 (* v_~i~0_460 4) v_~i~0_459)) (< v_~q~0_388 6) (= v_~q~0_388 (+ 5 v_~q~0_390)) (< v_~p~0_310 5) (< v_~x~0_325 1) (= (+ (* 3 v_~next~0_173) (* v_~prev~0_339 13) (* 21 v_~cur~0_283)) (* 5 v_~prev~0_338)) (= (+ v_~j~0_519 (* 5 v_~i~0_460)) v_~i~0_459) (= v_~p~0_309 (+ v_~p~0_310 1)) (= (+ 12 v_~x~0_325) v_~x~0_324) (= v_~next~0_173 v_~cur~0_282)) InVars {~j~0=v_~j~0_519, ~prev~0=v_~prev~0_339, ~i~0=v_~i~0_460, ~q~0=v_~q~0_390, ~p~0=v_~p~0_310, ~cur~0=v_~cur~0_283, ~x~0=v_~x~0_325} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_205|, ~j~0=v_~j~0_517, ~next~0=v_~next~0_173, ~prev~0=v_~prev~0_338, ~i~0=v_~i~0_459, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_217|, ~q~0=v_~q~0_388, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_269|, ~p~0=v_~p~0_309, ~cur~0=v_~cur~0_282, ~x~0=v_~x~0_324} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:45:23,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [422] L705-6-->L695-5: Formula: (and (= v_~j~0_529 (+ v_~j~0_531 (* v_~i~0_472 4) v_~i~0_471)) (< v_~p~0_321 6) (= (+ v_~i~0_472 (* v_~j~0_529 2)) (* 3 v_~i~0_471)) (= v_~q~0_398 (+ 5 v_~q~0_400)) (= (* 2 v_~next~0_177) (+ (* 21 v_~prev~0_347) (* 3 v_~prev~0_346) (* 34 v_~cur~0_291))) (= (+ 12 v_~x~0_333) v_~x~0_332) (< v_~x~0_333 1) (= v_~next~0_177 v_~cur~0_290) (= v_~p~0_321 (+ v_~p~0_322 2)) (< v_~q~0_398 6) (= (* 5 v_~prev~0_346) (+ (* 21 v_~cur~0_291) (* 3 v_~next~0_177) (* v_~prev~0_347 13)))) InVars {~j~0=v_~j~0_531, ~prev~0=v_~prev~0_347, ~i~0=v_~i~0_472, ~q~0=v_~q~0_400, ~p~0=v_~p~0_322, ~cur~0=v_~cur~0_291, ~x~0=v_~x~0_333} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_209|, ~j~0=v_~j~0_529, ~next~0=v_~next~0_177, ~prev~0=v_~prev~0_346, ~i~0=v_~i~0_471, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_223|, ~q~0=v_~q~0_398, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_275|, ~p~0=v_~p~0_321, ~cur~0=v_~cur~0_290, ~x~0=v_~x~0_332} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:45:23,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L687-5-->L687-5: Formula: (and (= (+ v_~i~0_199 (* v_~j~0_267 2)) v_~i~0_197) (< v_~p~0_95 6) (= (+ v_~p~0_97 2) v_~p~0_95)) InVars {~j~0=v_~j~0_267, ~i~0=v_~i~0_199, ~p~0=v_~p~0_97} OutVars{~j~0=v_~j~0_267, ~i~0=v_~i~0_197, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_73|, ~p~0=v_~p~0_95} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:45:23,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L687-5-->t1EXIT: Formula: (and (< v_~p~0_120 6) (= |v_t1Thread1of1ForFork1_#res.offset_24| 0) (= |v_t1Thread1of1ForFork1_#res.base_24| 0) (not (< v_~p~0_120 5)) (= (+ v_~p~0_121 2) v_~p~0_120) (= v_~i~0_215 (+ (* v_~j~0_273 2) v_~i~0_216))) InVars {~j~0=v_~j~0_273, ~i~0=v_~i~0_216, ~p~0=v_~p~0_121} OutVars{~j~0=v_~j~0_273, ~i~0=v_~i~0_215, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_85|, t1Thread1of1ForFork1_#res.base=|v_t1Thread1of1ForFork1_#res.base_24|, ~p~0=v_~p~0_120, t1Thread1of1ForFork1_#res.offset=|v_t1Thread1of1ForFork1_#res.offset_24|} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, t1Thread1of1ForFork1_#res.base, ~p~0, t1Thread1of1ForFork1_#res.offset] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:45:23,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L687-5-->L695-5: Formula: (and (= v_~p~0_345 (+ v_~p~0_346 2)) (= (+ (* v_~j~0_552 2) v_~i~0_496) v_~i~0_495) (= v_~j~0_551 (+ v_~j~0_552 v_~i~0_495)) (< v_~p~0_345 6) (= v_~q~0_420 (+ v_~q~0_421 1)) (< v_~q~0_421 5)) InVars {~j~0=v_~j~0_552, ~i~0=v_~i~0_496, ~q~0=v_~q~0_421, ~p~0=v_~p~0_346} OutVars{~j~0=v_~j~0_551, ~i~0=v_~i~0_495, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_237|, ~q~0=v_~q~0_420, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_287|, ~p~0=v_~p~0_345} AuxVars[] AssignedVars[~j~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:45:23,473 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 22:45:23,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2492 [2022-12-05 22:45:23,474 INFO L495 AbstractCegarLoop]: Abstraction has has 588 places, 1532 transitions, 59103 flow [2022-12-05 22:45:23,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:45:23,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:23,474 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:23,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-05 22:45:23,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:23,678 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:45:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 384657047, now seen corresponding path program 1 times [2022-12-05 22:45:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:23,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889140744] [2022-12-05 22:45:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:23,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889140744] [2022-12-05 22:45:23,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889140744] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:23,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574604468] [2022-12-05 22:45:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:23,729 INFO L229 MonitoredProcess]: Starting monitored process 48 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:45:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-05 22:45:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:23,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 22:45:23,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:23,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:45:23,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574604468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:45:23,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:45:23,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-05 22:45:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977193623] [2022-12-05 22:45:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:45:23,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:45:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:45:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:45:23,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:45:23,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 1532 transitions, 59103 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:45:23,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:23,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:45:23,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:30,205 INFO L130 PetriNetUnfolder]: 6157/10746 cut-off events. [2022-12-05 22:45:30,206 INFO L131 PetriNetUnfolder]: For 1885669/1885669 co-relation queries the response was YES. [2022-12-05 22:45:30,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179051 conditions, 10746 events. 6157/10746 cut-off events. For 1885669/1885669 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 87140 event pairs, 707 based on Foata normal form. 111/10855 useless extension candidates. Maximal degree in co-relation 178832. Up to 6064 conditions per place. [2022-12-05 22:45:30,449 INFO L137 encePairwiseOnDemand]: 35/61 looper letters, 1999 selfloop transitions, 423 changer transitions 135/2557 dead transitions. [2022-12-05 22:45:30,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 2557 transitions, 103815 flow [2022-12-05 22:45:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:45:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:45:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-05 22:45:30,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23653395784543327 [2022-12-05 22:45:30,450 INFO L175 Difference]: Start difference. First operand has 588 places, 1532 transitions, 59103 flow. Second operand 7 states and 101 transitions. [2022-12-05 22:45:30,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 2557 transitions, 103815 flow [2022-12-05 22:45:43,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 2557 transitions, 102978 flow, removed 203 selfloop flow, removed 16 redundant places. [2022-12-05 22:45:43,397 INFO L231 Difference]: Finished difference. Result has 581 places, 1630 transitions, 64670 flow [2022-12-05 22:45:43,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=57650, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64670, PETRI_PLACES=581, PETRI_TRANSITIONS=1630} [2022-12-05 22:45:43,398 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 563 predicate places. [2022-12-05 22:45:43,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:43,398 INFO L89 Accepts]: Start accepts. Operand has 581 places, 1630 transitions, 64670 flow [2022-12-05 22:45:43,411 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:43,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:43,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 581 places, 1630 transitions, 64670 flow [2022-12-05 22:45:43,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 579 places, 1630 transitions, 64670 flow [2022-12-05 22:45:44,965 INFO L130 PetriNetUnfolder]: 1306/3602 cut-off events. [2022-12-05 22:45:44,965 INFO L131 PetriNetUnfolder]: For 682524/683432 co-relation queries the response was YES. [2022-12-05 22:45:45,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70537 conditions, 3602 events. 1306/3602 cut-off events. For 682524/683432 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 37001 event pairs, 7 based on Foata normal form. 115/3714 useless extension candidates. Maximal degree in co-relation 70325. Up to 1640 conditions per place. [2022-12-05 22:45:45,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 579 places, 1630 transitions, 64670 flow [2022-12-05 22:45:45,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 4984 [2022-12-05 22:45:45,070 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:45:45,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1672 [2022-12-05 22:45:45,070 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 1630 transitions, 64670 flow [2022-12-05 22:45:45,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:45:45,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:45,071 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:45,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-05 22:45:45,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-05 22:45:45,274 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:45:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 375811907, now seen corresponding path program 1 times [2022-12-05 22:45:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:45,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412852160] [2022-12-05 22:45:45,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412852160] [2022-12-05 22:45:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412852160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324572089] [2022-12-05 22:45:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:45,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:45,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:45,441 INFO L229 MonitoredProcess]: Starting monitored process 49 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:45:45,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-05 22:45:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:45,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-05 22:45:45,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:45,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:45:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:45,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324572089] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:45:45,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:45:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:45:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412548886] [2022-12-05 22:45:45,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:45:45,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:45:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:45:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:45:45,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-05 22:45:45,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1630 transitions, 64670 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:45,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:45,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-05 22:45:45,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:55,171 INFO L130 PetriNetUnfolder]: 6089/10669 cut-off events. [2022-12-05 22:45:55,171 INFO L131 PetriNetUnfolder]: For 1999868/1999868 co-relation queries the response was YES. [2022-12-05 22:45:55,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180676 conditions, 10669 events. 6089/10669 cut-off events. For 1999868/1999868 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 85846 event pairs, 1397 based on Foata normal form. 43/10710 useless extension candidates. Maximal degree in co-relation 180461. Up to 9538 conditions per place. [2022-12-05 22:45:55,331 INFO L137 encePairwiseOnDemand]: 14/59 looper letters, 1443 selfloop transitions, 296 changer transitions 38/1777 dead transitions. [2022-12-05 22:45:55,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 1777 transitions, 71425 flow [2022-12-05 22:45:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:45:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:45:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 180 transitions. [2022-12-05 22:45:55,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09533898305084745 [2022-12-05 22:45:55,336 INFO L175 Difference]: Start difference. First operand has 579 places, 1630 transitions, 64670 flow. Second operand 32 states and 180 transitions. [2022-12-05 22:45:55,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 1777 transitions, 71425 flow [2022-12-05 22:46:11,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 1777 transitions, 69582 flow, removed 842 selfloop flow, removed 7 redundant places. [2022-12-05 22:46:11,613 INFO L231 Difference]: Finished difference. Result has 609 places, 1653 transitions, 65050 flow [2022-12-05 22:46:11,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=62966, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=65050, PETRI_PLACES=609, PETRI_TRANSITIONS=1653} [2022-12-05 22:46:11,615 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 591 predicate places. [2022-12-05 22:46:11,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:46:11,615 INFO L89 Accepts]: Start accepts. Operand has 609 places, 1653 transitions, 65050 flow [2022-12-05 22:46:11,627 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:46:11,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:46:11,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 609 places, 1653 transitions, 65050 flow [2022-12-05 22:46:11,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 609 places, 1653 transitions, 65050 flow [2022-12-05 22:46:13,167 INFO L130 PetriNetUnfolder]: 1306/3640 cut-off events. [2022-12-05 22:46:13,168 INFO L131 PetriNetUnfolder]: For 695984/696752 co-relation queries the response was YES. [2022-12-05 22:46:13,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70436 conditions, 3640 events. 1306/3640 cut-off events. For 695984/696752 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 37584 event pairs, 6 based on Foata normal form. 108/3745 useless extension candidates. Maximal degree in co-relation 70222. Up to 1659 conditions per place. [2022-12-05 22:46:13,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 609 places, 1653 transitions, 65050 flow [2022-12-05 22:46:13,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 5018 [2022-12-05 22:46:13,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L687-5-->L695-5: Formula: (and (= v_~next~0_179 v_~cur~0_294) (< v_~x~0_337 1) (= (+ (* 34 v_~cur~0_295) (* 21 v_~prev~0_351) (* 3 v_~prev~0_350)) (* 2 v_~next~0_179)) (= (+ (* 5 v_~i~0_485) (* v_~j~0_544 6)) v_~i~0_483) (= (* 5 v_~prev~0_350) (+ (* v_~prev~0_351 13) (* 3 v_~next~0_179) (* 21 v_~cur~0_295))) (= (+ 5 v_~q~0_413) v_~q~0_412) (= v_~j~0_543 (+ (* v_~j~0_544 5) (* v_~i~0_485 4) v_~i~0_483)) (= (+ 12 v_~x~0_337) v_~x~0_336) (< v_~p~0_333 6) (< v_~q~0_412 6) (= v_~p~0_333 (+ v_~p~0_335 2))) InVars {~j~0=v_~j~0_544, ~prev~0=v_~prev~0_351, ~i~0=v_~i~0_485, ~q~0=v_~q~0_413, ~p~0=v_~p~0_335, ~cur~0=v_~cur~0_295, ~x~0=v_~x~0_337} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_211|, ~j~0=v_~j~0_543, ~next~0=v_~next~0_179, ~prev~0=v_~prev~0_350, ~i~0=v_~i~0_483, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_229|, ~q~0=v_~q~0_412, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_283|, ~p~0=v_~p~0_333, ~cur~0=v_~cur~0_294, ~x~0=v_~x~0_336} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:46:13,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L687-5-->L695-5: Formula: (and (= (+ v_~p~0_341 3) v_~p~0_339) (= (+ (* v_~prev~0_355 13) (* 3 v_~next~0_181) (* 21 v_~cur~0_299)) (* 5 v_~prev~0_354)) (= (+ 12 v_~x~0_341) v_~x~0_340) (= (+ v_~j~0_548 (* v_~j~0_547 2) v_~i~0_491) (* 3 v_~i~0_489)) (< v_~x~0_341 1) (= (+ 5 v_~q~0_417) v_~q~0_416) (= v_~j~0_547 (+ (* v_~j~0_548 5) v_~i~0_489 (* v_~i~0_491 4))) (= (* 2 v_~next~0_181) (+ (* 3 v_~prev~0_354) (* 21 v_~prev~0_355) (* 34 v_~cur~0_299))) (< v_~q~0_416 6) (< v_~p~0_339 6) (= v_~next~0_181 v_~cur~0_298)) InVars {~j~0=v_~j~0_548, ~prev~0=v_~prev~0_355, ~i~0=v_~i~0_491, ~q~0=v_~q~0_417, ~p~0=v_~p~0_341, ~cur~0=v_~cur~0_299, ~x~0=v_~x~0_341} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_213|, ~j~0=v_~j~0_547, ~next~0=v_~next~0_181, ~prev~0=v_~prev~0_354, ~i~0=v_~i~0_489, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_233|, ~q~0=v_~q~0_416, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_285|, ~p~0=v_~p~0_339, ~cur~0=v_~cur~0_298, ~x~0=v_~x~0_340} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:46:13,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] L687-5-->L687-5: Formula: (and (= v_~i~0_503 (+ v_~j~0_559 v_~i~0_505 (* v_~j~0_560 2))) (= (+ v_~p~0_355 3) v_~p~0_353) (= (* v_~j~0_559 2) (+ v_~j~0_560 v_~i~0_503)) (< v_~p~0_353 6) (< v_~q~0_429 5) (= v_~q~0_428 (+ v_~q~0_429 1))) InVars {~j~0=v_~j~0_560, ~i~0=v_~i~0_505, ~q~0=v_~q~0_429, ~p~0=v_~p~0_355} OutVars{~j~0=v_~j~0_559, ~i~0=v_~i~0_503, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_241|, ~q~0=v_~q~0_428, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_291|, ~p~0=v_~p~0_353} AuxVars[] AssignedVars[~j~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:46:13,885 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:46:13,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2270 [2022-12-05 22:46:13,885 INFO L495 AbstractCegarLoop]: Abstraction has has 605 places, 1649 transitions, 64947 flow [2022-12-05 22:46:13,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:13,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:46:13,886 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:46:13,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-05 22:46:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:14,090 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:46:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:46:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1744442458, now seen corresponding path program 3 times [2022-12-05 22:46:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:46:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247066454] [2022-12-05 22:46:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:46:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:46:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:46:14,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247066454] [2022-12-05 22:46:14,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247066454] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:46:14,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436748901] [2022-12-05 22:46:14,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 22:46:14,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:46:14,213 INFO L229 MonitoredProcess]: Starting monitored process 50 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:46:14,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-05 22:46:14,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 22:46:14,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:46:14,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:46:14,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:46:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:46:14,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:46:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:46:14,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436748901] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:46:14,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:46:14,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-05 22:46:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985679886] [2022-12-05 22:46:14,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:46:14,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:46:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:46:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:46:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2022-12-05 22:46:14,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-05 22:46:14,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 1649 transitions, 64947 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:46:14,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:46:14,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-05 22:46:14,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:27,053 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 90 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:46:35,883 WARN L233 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 83 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:46:46,617 INFO L130 PetriNetUnfolder]: 6408/11294 cut-off events. [2022-12-05 22:46:46,617 INFO L131 PetriNetUnfolder]: For 2489609/2489609 co-relation queries the response was YES. [2022-12-05 22:46:46,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187661 conditions, 11294 events. 6408/11294 cut-off events. For 2489609/2489609 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 92341 event pairs, 615 based on Foata normal form. 100/11392 useless extension candidates. Maximal degree in co-relation 187444. Up to 7468 conditions per place. [2022-12-05 22:46:46,784 INFO L137 encePairwiseOnDemand]: 8/60 looper letters, 1173 selfloop transitions, 858 changer transitions 21/2052 dead transitions. [2022-12-05 22:46:46,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 2052 transitions, 78869 flow [2022-12-05 22:46:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-05 22:46:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-05 22:46:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 252 transitions. [2022-12-05 22:46:46,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.105 [2022-12-05 22:46:46,785 INFO L175 Difference]: Start difference. First operand has 605 places, 1649 transitions, 64947 flow. Second operand 40 states and 252 transitions. [2022-12-05 22:46:46,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 2052 transitions, 78869 flow [2022-12-05 22:47:03,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 2052 transitions, 78292 flow, removed 216 selfloop flow, removed 17 redundant places. [2022-12-05 22:47:03,642 INFO L231 Difference]: Finished difference. Result has 639 places, 1775 transitions, 72511 flow [2022-12-05 22:47:03,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=64378, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=742, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=72511, PETRI_PLACES=639, PETRI_TRANSITIONS=1775} [2022-12-05 22:47:03,644 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 621 predicate places. [2022-12-05 22:47:03,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:47:03,644 INFO L89 Accepts]: Start accepts. Operand has 639 places, 1775 transitions, 72511 flow [2022-12-05 22:47:03,663 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:47:03,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:47:03,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 639 places, 1775 transitions, 72511 flow [2022-12-05 22:47:03,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 639 places, 1775 transitions, 72511 flow [2022-12-05 22:47:05,440 INFO L130 PetriNetUnfolder]: 1376/3869 cut-off events. [2022-12-05 22:47:05,440 INFO L131 PetriNetUnfolder]: For 781589/782365 co-relation queries the response was YES. [2022-12-05 22:47:05,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77130 conditions, 3869 events. 1376/3869 cut-off events. For 781589/782365 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 40791 event pairs, 4 based on Foata normal form. 92/3958 useless extension candidates. Maximal degree in co-relation 76903. Up to 1813 conditions per place. [2022-12-05 22:47:05,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 639 places, 1775 transitions, 72511 flow [2022-12-05 22:47:05,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 5320 [2022-12-05 22:47:05,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:47:05,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1977 [2022-12-05 22:47:05,621 INFO L495 AbstractCegarLoop]: Abstraction has has 639 places, 1775 transitions, 72524 flow [2022-12-05 22:47:05,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:47:05,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:47:05,621 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:47:05,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-05 22:47:05,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-12-05 22:47:05,825 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:47:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:47:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1670751181, now seen corresponding path program 1 times [2022-12-05 22:47:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:47:05,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787256523] [2022-12-05 22:47:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:47:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:47:05,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787256523] [2022-12-05 22:47:05,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787256523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:47:05,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16343249] [2022-12-05 22:47:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:47:05,861 INFO L229 MonitoredProcess]: Starting monitored process 51 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:47:05,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-05 22:47:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:05,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:47:05,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:47:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:47:05,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:47:05,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16343249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:47:05,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:47:05,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-12-05 22:47:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038973570] [2022-12-05 22:47:05,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:47:05,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:47:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:47:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:47:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:47:05,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:47:05,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 1775 transitions, 72524 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:05,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:47:05,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:47:05,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:47:13,921 INFO L130 PetriNetUnfolder]: 6406/11292 cut-off events. [2022-12-05 22:47:13,922 INFO L131 PetriNetUnfolder]: For 2047023/2047023 co-relation queries the response was YES. [2022-12-05 22:47:14,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192426 conditions, 11292 events. 6406/11292 cut-off events. For 2047023/2047023 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 94654 event pairs, 1052 based on Foata normal form. 2/11292 useless extension candidates. Maximal degree in co-relation 192196. Up to 5925 conditions per place. [2022-12-05 22:47:14,097 INFO L137 encePairwiseOnDemand]: 53/61 looper letters, 2439 selfloop transitions, 13 changer transitions 219/2671 dead transitions. [2022-12-05 22:47:14,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 2671 transitions, 114814 flow [2022-12-05 22:47:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:47:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:47:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-05 22:47:14,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28524590163934427 [2022-12-05 22:47:14,099 INFO L175 Difference]: Start difference. First operand has 639 places, 1775 transitions, 72524 flow. Second operand 5 states and 87 transitions. [2022-12-05 22:47:14,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 2671 transitions, 114814 flow [2022-12-05 22:47:30,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 2671 transitions, 110656 flow, removed 1941 selfloop flow, removed 11 redundant places. [2022-12-05 22:47:30,654 INFO L231 Difference]: Finished difference. Result has 632 places, 1772 transitions, 69544 flow [2022-12-05 22:47:30,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=69609, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69544, PETRI_PLACES=632, PETRI_TRANSITIONS=1772} [2022-12-05 22:47:30,656 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 614 predicate places. [2022-12-05 22:47:30,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:47:30,656 INFO L89 Accepts]: Start accepts. Operand has 632 places, 1772 transitions, 69544 flow [2022-12-05 22:47:30,667 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:47:30,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:47:30,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 632 places, 1772 transitions, 69544 flow [2022-12-05 22:47:30,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 631 places, 1772 transitions, 69544 flow [2022-12-05 22:47:32,171 INFO L130 PetriNetUnfolder]: 1375/3865 cut-off events. [2022-12-05 22:47:32,171 INFO L131 PetriNetUnfolder]: For 777598/778335 co-relation queries the response was YES. [2022-12-05 22:47:32,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75611 conditions, 3865 events. 1375/3865 cut-off events. For 777598/778335 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 40727 event pairs, 4 based on Foata normal form. 92/3954 useless extension candidates. Maximal degree in co-relation 75383. Up to 1801 conditions per place. [2022-12-05 22:47:32,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 631 places, 1772 transitions, 69544 flow [2022-12-05 22:47:32,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 5316 [2022-12-05 22:47:32,467 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:47:32,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1811 [2022-12-05 22:47:32,467 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 1772 transitions, 69544 flow [2022-12-05 22:47:32,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:32,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:47:32,468 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:47:32,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-05 22:47:32,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-05 22:47:32,672 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:47:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:47:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1841922514, now seen corresponding path program 1 times [2022-12-05 22:47:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:47:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056186406] [2022-12-05 22:47:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:47:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:47:32,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056186406] [2022-12-05 22:47:32,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056186406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:47:32,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415241652] [2022-12-05 22:47:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:32,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:32,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:47:32,798 INFO L229 MonitoredProcess]: Starting monitored process 52 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:47:32,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-05 22:47:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:32,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:47:32,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:47:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:33,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:47:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:33,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415241652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:47:33,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:47:33,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:47:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142052189] [2022-12-05 22:47:33,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:47:33,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:47:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:47:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:47:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:47:33,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-05 22:47:33,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 1772 transitions, 69544 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:33,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:47:33,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-05 22:47:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:47:37,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:47:49,175 INFO L130 PetriNetUnfolder]: 6459/11395 cut-off events. [2022-12-05 22:47:49,176 INFO L131 PetriNetUnfolder]: For 2140901/2140901 co-relation queries the response was YES. [2022-12-05 22:47:49,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192853 conditions, 11395 events. 6459/11395 cut-off events. For 2140901/2140901 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 93630 event pairs, 1233 based on Foata normal form. 22/11415 useless extension candidates. Maximal degree in co-relation 192622. Up to 9526 conditions per place. [2022-12-05 22:47:49,347 INFO L137 encePairwiseOnDemand]: 10/60 looper letters, 1432 selfloop transitions, 511 changer transitions 33/1976 dead transitions. [2022-12-05 22:47:49,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 1976 transitions, 77706 flow [2022-12-05 22:47:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-05 22:47:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-05 22:47:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 215 transitions. [2022-12-05 22:47:49,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09953703703703703 [2022-12-05 22:47:49,348 INFO L175 Difference]: Start difference. First operand has 631 places, 1772 transitions, 69544 flow. Second operand 36 states and 215 transitions. [2022-12-05 22:47:49,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 1976 transitions, 77706 flow [2022-12-05 22:48:09,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 1976 transitions, 77642 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:48:09,454 INFO L231 Difference]: Finished difference. Result has 668 places, 1796 transitions, 72222 flow [2022-12-05 22:48:09,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=69530, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=490, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=72222, PETRI_PLACES=668, PETRI_TRANSITIONS=1796} [2022-12-05 22:48:09,456 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 650 predicate places. [2022-12-05 22:48:09,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:09,456 INFO L89 Accepts]: Start accepts. Operand has 668 places, 1796 transitions, 72222 flow [2022-12-05 22:48:09,474 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:09,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:09,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 668 places, 1796 transitions, 72222 flow [2022-12-05 22:48:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 668 places, 1796 transitions, 72222 flow [2022-12-05 22:48:11,381 INFO L130 PetriNetUnfolder]: 1390/3909 cut-off events. [2022-12-05 22:48:11,382 INFO L131 PetriNetUnfolder]: For 820351/821098 co-relation queries the response was YES. [2022-12-05 22:48:11,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77726 conditions, 3909 events. 1390/3909 cut-off events. For 820351/821098 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 41326 event pairs, 3 based on Foata normal form. 106/4012 useless extension candidates. Maximal degree in co-relation 77494. Up to 1828 conditions per place. [2022-12-05 22:48:11,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 668 places, 1796 transitions, 72222 flow [2022-12-05 22:48:11,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 5374 [2022-12-05 22:48:11,854 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:48:11,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2399 [2022-12-05 22:48:11,855 INFO L495 AbstractCegarLoop]: Abstraction has has 666 places, 1794 transitions, 72259 flow [2022-12-05 22:48:11,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:11,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:11,855 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:11,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-05 22:48:12,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:12,061 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:48:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 552748681, now seen corresponding path program 1 times [2022-12-05 22:48:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:12,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893943584] [2022-12-05 22:48:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:12,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:12,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893943584] [2022-12-05 22:48:12,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893943584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:12,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992852192] [2022-12-05 22:48:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:12,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:12,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:12,085 INFO L229 MonitoredProcess]: Starting monitored process 53 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:48:12,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-05 22:48:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:12,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:48:12,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:12,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:48:12,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992852192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:48:12,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:48:12,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-05 22:48:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854617504] [2022-12-05 22:48:12,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:48:12,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:48:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:12,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:48:12,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:48:12,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-05 22:48:12,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 1794 transitions, 72259 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:48:12,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:12,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-05 22:48:12,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:48:20,020 INFO L130 PetriNetUnfolder]: 6445/11367 cut-off events. [2022-12-05 22:48:20,020 INFO L131 PetriNetUnfolder]: For 2116556/2116556 co-relation queries the response was YES. [2022-12-05 22:48:20,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194932 conditions, 11367 events. 6445/11367 cut-off events. For 2116556/2116556 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 95496 event pairs, 1056 based on Foata normal form. 2/11367 useless extension candidates. Maximal degree in co-relation 194697. Up to 5965 conditions per place. [2022-12-05 22:48:20,194 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 2460 selfloop transitions, 13 changer transitions 226/2699 dead transitions. [2022-12-05 22:48:20,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 2699 transitions, 114607 flow [2022-12-05 22:48:20,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:48:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:48:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-05 22:48:20,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-05 22:48:20,195 INFO L175 Difference]: Start difference. First operand has 666 places, 1794 transitions, 72259 flow. Second operand 4 states and 88 transitions. [2022-12-05 22:48:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 2699 transitions, 114607 flow [2022-12-05 22:48:37,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 2699 transitions, 113988 flow, removed 187 selfloop flow, removed 20 redundant places. [2022-12-05 22:48:37,229 INFO L231 Difference]: Finished difference. Result has 649 places, 1791 transitions, 71725 flow [2022-12-05 22:48:37,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=71768, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71725, PETRI_PLACES=649, PETRI_TRANSITIONS=1791} [2022-12-05 22:48:37,230 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 631 predicate places. [2022-12-05 22:48:37,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:37,230 INFO L89 Accepts]: Start accepts. Operand has 649 places, 1791 transitions, 71725 flow [2022-12-05 22:48:37,259 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:37,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:37,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 649 places, 1791 transitions, 71725 flow [2022-12-05 22:48:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 649 places, 1791 transitions, 71725 flow [2022-12-05 22:48:38,828 INFO L130 PetriNetUnfolder]: 1391/3904 cut-off events. [2022-12-05 22:48:38,828 INFO L131 PetriNetUnfolder]: For 822666/823397 co-relation queries the response was YES. [2022-12-05 22:48:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78130 conditions, 3904 events. 1391/3904 cut-off events. For 822666/823397 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 41170 event pairs, 5 based on Foata normal form. 108/4009 useless extension candidates. Maximal degree in co-relation 77898. Up to 1828 conditions per place. [2022-12-05 22:48:38,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 649 places, 1791 transitions, 71725 flow [2022-12-05 22:48:38,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 5360 [2022-12-05 22:48:38,946 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:48:38,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1717 [2022-12-05 22:48:38,947 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 1791 transitions, 71725 flow [2022-12-05 22:48:38,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:48:38,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:38,947 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:38,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-12-05 22:48:39,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-05 22:48:39,155 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:48:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1113864908, now seen corresponding path program 4 times [2022-12-05 22:48:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:39,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16868528] [2022-12-05 22:48:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:39,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16868528] [2022-12-05 22:48:39,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16868528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:39,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017939551] [2022-12-05 22:48:39,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 22:48:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:39,275 INFO L229 MonitoredProcess]: Starting monitored process 54 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:48:39,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-05 22:48:39,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 22:48:39,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:48:39,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:48:39,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:39,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:48:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017939551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:48:40,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:48:40,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-05 22:48:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424668126] [2022-12-05 22:48:40,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:48:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:48:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:48:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-12-05 22:48:40,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-05 22:48:40,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 1791 transitions, 71725 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:48:40,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:40,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-05 22:48:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:48:58,933 INFO L130 PetriNetUnfolder]: 7469/13144 cut-off events. [2022-12-05 22:48:58,933 INFO L131 PetriNetUnfolder]: For 3885540/3885540 co-relation queries the response was YES. [2022-12-05 22:48:59,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235440 conditions, 13144 events. 7469/13144 cut-off events. For 3885540/3885540 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 109684 event pairs, 413 based on Foata normal form. 136/13278 useless extension candidates. Maximal degree in co-relation 235205. Up to 5536 conditions per place. [2022-12-05 22:48:59,152 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 883 selfloop transitions, 1452 changer transitions 21/2356 dead transitions. [2022-12-05 22:48:59,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 2356 transitions, 92842 flow [2022-12-05 22:48:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-05 22:48:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-05 22:48:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 302 transitions. [2022-12-05 22:48:59,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10199257007767647 [2022-12-05 22:48:59,154 INFO L175 Difference]: Start difference. First operand has 649 places, 1791 transitions, 71725 flow. Second operand 47 states and 302 transitions. [2022-12-05 22:48:59,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 2356 transitions, 92842 flow [2022-12-05 22:49:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 2356 transitions, 92445 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-05 22:49:25,324 INFO L231 Difference]: Finished difference. Result has 703 places, 2016 transitions, 86399 flow [2022-12-05 22:49:25,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=71637, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=86399, PETRI_PLACES=703, PETRI_TRANSITIONS=2016} [2022-12-05 22:49:25,326 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 685 predicate places. [2022-12-05 22:49:25,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:49:25,326 INFO L89 Accepts]: Start accepts. Operand has 703 places, 2016 transitions, 86399 flow [2022-12-05 22:49:25,344 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:49:25,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:49:25,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 703 places, 2016 transitions, 86399 flow [2022-12-05 22:49:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 703 places, 2016 transitions, 86399 flow [2022-12-05 22:49:27,334 INFO L130 PetriNetUnfolder]: 1595/4477 cut-off events. [2022-12-05 22:49:27,334 INFO L131 PetriNetUnfolder]: For 1250704/1251633 co-relation queries the response was YES. [2022-12-05 22:49:27,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98168 conditions, 4477 events. 1595/4477 cut-off events. For 1250704/1251633 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 48551 event pairs, 6 based on Foata normal form. 109/4583 useless extension candidates. Maximal degree in co-relation 97926. Up to 2207 conditions per place. [2022-12-05 22:49:27,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 703 places, 2016 transitions, 86399 flow [2022-12-05 22:49:27,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 6052 [2022-12-05 22:49:27,550 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:49:27,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2225 [2022-12-05 22:49:27,551 INFO L495 AbstractCegarLoop]: Abstraction has has 703 places, 2016 transitions, 86414 flow [2022-12-05 22:49:27,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:49:27,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:49:27,551 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:49:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-05 22:49:27,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-05 22:49:27,756 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:49:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:49:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1020430743, now seen corresponding path program 1 times [2022-12-05 22:49:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:49:27,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794413561] [2022-12-05 22:49:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:49:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:49:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:49:28,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794413561] [2022-12-05 22:49:28,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794413561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:49:28,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997083741] [2022-12-05 22:49:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:28,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:49:28,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:49:28,103 INFO L229 MonitoredProcess]: Starting monitored process 55 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:49:28,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-05 22:49:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:28,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:49:28,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:49:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:49:28,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:49:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:49:28,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997083741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:49:28,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:49:28,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:49:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695895775] [2022-12-05 22:49:28,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:49:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:49:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:49:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:49:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:49:28,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-05 22:49:28,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 2016 transitions, 86414 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:49:28,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:49:28,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-05 22:49:28,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:49:42,155 INFO L130 PetriNetUnfolder]: 8269/14474 cut-off events. [2022-12-05 22:49:42,155 INFO L131 PetriNetUnfolder]: For 4533632/4533632 co-relation queries the response was YES. [2022-12-05 22:49:42,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280417 conditions, 14474 events. 8269/14474 cut-off events. For 4533632/4533632 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 121589 event pairs, 626 based on Foata normal form. 52/14524 useless extension candidates. Maximal degree in co-relation 280172. Up to 8006 conditions per place. [2022-12-05 22:49:42,400 INFO L137 encePairwiseOnDemand]: 8/65 looper letters, 1119 selfloop transitions, 1229 changer transitions 6/2354 dead transitions. [2022-12-05 22:49:42,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 2354 transitions, 101382 flow [2022-12-05 22:49:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:49:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:49:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 182 transitions. [2022-12-05 22:49:42,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12727272727272726 [2022-12-05 22:49:42,401 INFO L175 Difference]: Start difference. First operand has 703 places, 2016 transitions, 86414 flow. Second operand 22 states and 182 transitions. [2022-12-05 22:49:42,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 2354 transitions, 101382 flow [2022-12-05 22:50:15,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 2354 transitions, 96241 flow, removed 2361 selfloop flow, removed 23 redundant places. [2022-12-05 22:50:15,549 INFO L231 Difference]: Finished difference. Result has 707 places, 2156 transitions, 91888 flow [2022-12-05 22:50:15,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=81661, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=91888, PETRI_PLACES=707, PETRI_TRANSITIONS=2156} [2022-12-05 22:50:15,551 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 689 predicate places. [2022-12-05 22:50:15,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:15,551 INFO L89 Accepts]: Start accepts. Operand has 707 places, 2156 transitions, 91888 flow [2022-12-05 22:50:15,571 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:15,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:15,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 707 places, 2156 transitions, 91888 flow [2022-12-05 22:50:15,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 707 places, 2156 transitions, 91888 flow [2022-12-05 22:50:18,240 INFO L130 PetriNetUnfolder]: 1781/4913 cut-off events. [2022-12-05 22:50:18,241 INFO L131 PetriNetUnfolder]: For 1746190/1747219 co-relation queries the response was YES. [2022-12-05 22:50:18,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112510 conditions, 4913 events. 1781/4913 cut-off events. For 1746190/1747219 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 53462 event pairs, 23 based on Foata normal form. 100/5010 useless extension candidates. Maximal degree in co-relation 112264. Up to 2491 conditions per place. [2022-12-05 22:50:18,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 707 places, 2156 transitions, 91888 flow [2022-12-05 22:50:18,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 6514 [2022-12-05 22:50:18,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:50:18,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2895 [2022-12-05 22:50:18,447 INFO L495 AbstractCegarLoop]: Abstraction has has 707 places, 2156 transitions, 91905 flow [2022-12-05 22:50:18,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:18,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:18,447 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:18,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-12-05 22:50:18,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:18,651 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:50:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash 328886258, now seen corresponding path program 1 times [2022-12-05 22:50:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:18,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799489311] [2022-12-05 22:50:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:18,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799489311] [2022-12-05 22:50:18,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799489311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:18,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336057619] [2022-12-05 22:50:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:18,680 INFO L229 MonitoredProcess]: Starting monitored process 56 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:50:18,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-05 22:50:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:18,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:50:18,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:18,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:50:18,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336057619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:50:18,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:50:18,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:50:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476875580] [2022-12-05 22:50:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:50:18,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:50:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:18,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:50:18,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:50:18,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-05 22:50:18,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 2156 transitions, 91905 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 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:50:18,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:18,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-05 22:50:18,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:30,822 INFO L130 PetriNetUnfolder]: 8232/14422 cut-off events. [2022-12-05 22:50:30,823 INFO L131 PetriNetUnfolder]: For 4390686/4390686 co-relation queries the response was YES. [2022-12-05 22:50:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279361 conditions, 14422 events. 8232/14422 cut-off events. For 4390686/4390686 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 123305 event pairs, 932 based on Foata normal form. 48/14468 useless extension candidates. Maximal degree in co-relation 279112. Up to 7284 conditions per place. [2022-12-05 22:50:31,062 INFO L137 encePairwiseOnDemand]: 43/66 looper letters, 2871 selfloop transitions, 60 changer transitions 249/3180 dead transitions. [2022-12-05 22:50:31,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 3180 transitions, 141580 flow [2022-12-05 22:50:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:50:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:50:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-05 22:50:31,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2601010101010101 [2022-12-05 22:50:31,064 INFO L175 Difference]: Start difference. First operand has 707 places, 2156 transitions, 91905 flow. Second operand 6 states and 103 transitions. [2022-12-05 22:50:31,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 3180 transitions, 141580 flow [2022-12-05 22:51:03,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 3180 transitions, 140522 flow, removed 410 selfloop flow, removed 13 redundant places. [2022-12-05 22:51:03,558 INFO L231 Difference]: Finished difference. Result has 701 places, 2119 transitions, 89492 flow [2022-12-05 22:51:03,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=89582, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89492, PETRI_PLACES=701, PETRI_TRANSITIONS=2119} [2022-12-05 22:51:03,560 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 683 predicate places. [2022-12-05 22:51:03,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:51:03,560 INFO L89 Accepts]: Start accepts. Operand has 701 places, 2119 transitions, 89492 flow [2022-12-05 22:51:03,576 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:51:03,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:51:03,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 701 places, 2119 transitions, 89492 flow [2022-12-05 22:51:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 699 places, 2119 transitions, 89492 flow [2022-12-05 22:51:06,206 INFO L130 PetriNetUnfolder]: 1767/4880 cut-off events. [2022-12-05 22:51:06,207 INFO L131 PetriNetUnfolder]: For 1743768/1744623 co-relation queries the response was YES. [2022-12-05 22:51:06,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112288 conditions, 4880 events. 1767/4880 cut-off events. For 1743768/1744623 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 52930 event pairs, 28 based on Foata normal form. 95/4972 useless extension candidates. Maximal degree in co-relation 112042. Up to 2460 conditions per place. [2022-12-05 22:51:06,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 699 places, 2119 transitions, 89492 flow [2022-12-05 22:51:06,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 6444 [2022-12-05 22:51:06,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_257) v_~x~0_256) (= (* 5 v_~prev~0_270) (+ (* 21 v_~cur~0_225) (* v_~prev~0_271 13) (* 3 v_~next~0_139))) (< v_~x~0_257 1) (< v_~q~0_239 3) (= v_~j~0_335 (+ v_~j~0_337 (* 3 v_~i~0_275))) (= (+ v_~q~0_239 3) v_~q~0_237) (= (* 2 v_~next~0_139) (+ (* 21 v_~prev~0_271) (* 34 v_~cur~0_225) (* 3 v_~prev~0_270))) (= v_~next~0_139 v_~cur~0_224)) InVars {~j~0=v_~j~0_337, ~prev~0=v_~prev~0_271, ~i~0=v_~i~0_275, ~q~0=v_~q~0_239, ~cur~0=v_~cur~0_225, ~x~0=v_~x~0_257} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_335, ~next~0=v_~next~0_139, ~prev~0=v_~prev~0_270, ~i~0=v_~i~0_275, ~q~0=v_~q~0_237, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_168|, ~cur~0=v_~cur~0_224, ~x~0=v_~x~0_256} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [388] L687-5-->L687-5: Formula: (and (= (+ v_~p~0_190 2) v_~p~0_188) (= v_~i~0_295 (+ (* v_~j~0_357 2) v_~i~0_297)) (< v_~p~0_190 4)) InVars {~j~0=v_~j~0_357, ~i~0=v_~i~0_297, ~p~0=v_~p~0_190} OutVars{~j~0=v_~j~0_357, ~i~0=v_~i~0_295, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_130|, ~p~0=v_~p~0_188} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:51:06,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_257) v_~x~0_256) (= (* 5 v_~prev~0_270) (+ (* 21 v_~cur~0_225) (* v_~prev~0_271 13) (* 3 v_~next~0_139))) (< v_~x~0_257 1) (< v_~q~0_239 3) (= v_~j~0_335 (+ v_~j~0_337 (* 3 v_~i~0_275))) (= (+ v_~q~0_239 3) v_~q~0_237) (= (* 2 v_~next~0_139) (+ (* 21 v_~prev~0_271) (* 34 v_~cur~0_225) (* 3 v_~prev~0_270))) (= v_~next~0_139 v_~cur~0_224)) InVars {~j~0=v_~j~0_337, ~prev~0=v_~prev~0_271, ~i~0=v_~i~0_275, ~q~0=v_~q~0_239, ~cur~0=v_~cur~0_225, ~x~0=v_~x~0_257} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_335, ~next~0=v_~next~0_139, ~prev~0=v_~prev~0_270, ~i~0=v_~i~0_275, ~q~0=v_~q~0_237, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_168|, ~cur~0=v_~cur~0_224, ~x~0=v_~x~0_256} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:51:06,595 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L695-5-->L695-5: Formula: (and (= v_~j~0_387 (+ v_~j~0_389 (* 3 v_~i~0_323))) (< v_~q~0_280 6) (= (+ v_~q~0_282 3) v_~q~0_280)) InVars {~j~0=v_~j~0_389, ~i~0=v_~i~0_323, ~q~0=v_~q~0_282} OutVars{~j~0=v_~j~0_387, ~i~0=v_~i~0_323, ~q~0=v_~q~0_280, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_198|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:51:06,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [447] L705-6-->L687-5: Formula: (and (= (+ (* v_~j~0_659 2) v_~i~0_614) v_~i~0_613) (= (+ (* v_~prev~0_385 13) (* 3 v_~next~0_196) (* 21 v_~cur~0_324)) (* 5 v_~prev~0_384)) (= v_~j~0_659 (+ v_~j~0_660 (* 3 v_~i~0_614))) (= (+ v_~p~0_458 2) v_~p~0_457) (< v_~p~0_458 4) (= (* 2 v_~next~0_196) (+ (* 21 v_~prev~0_385) (* 34 v_~cur~0_324) (* 3 v_~prev~0_384))) (< v_~q~0_514 3) (< v_~x~0_371 1) (= (+ v_~q~0_514 3) v_~q~0_513) (= (+ 12 v_~x~0_371) v_~x~0_370) (= v_~next~0_196 v_~cur~0_323)) InVars {~j~0=v_~j~0_660, ~prev~0=v_~prev~0_385, ~i~0=v_~i~0_614, ~q~0=v_~q~0_514, ~p~0=v_~p~0_458, ~cur~0=v_~cur~0_324, ~x~0=v_~x~0_371} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_233|, ~j~0=v_~j~0_659, ~next~0=v_~next~0_196, ~prev~0=v_~prev~0_384, ~i~0=v_~i~0_613, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_308|, ~q~0=v_~q~0_513, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_347|, ~p~0=v_~p~0_457, ~cur~0=v_~cur~0_323, ~x~0=v_~x~0_370} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:51:06,734 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [448] L705-6-->L687-5: Formula: (and (= v_~j~0_663 (+ v_~j~0_664 (* 3 v_~i~0_618))) (< v_~q~0_518 3) (= v_~p~0_461 (+ v_~p~0_462 1)) (= v_~next~0_198 v_~cur~0_327) (= (* 5 v_~prev~0_388) (+ (* v_~prev~0_389 13) (* 3 v_~next~0_198) (* 21 v_~cur~0_328))) (< v_~p~0_462 5) (= v_~i~0_617 (+ v_~j~0_663 v_~i~0_618)) (< v_~x~0_375 1) (= (+ 12 v_~x~0_375) v_~x~0_374) (= (* 2 v_~next~0_198) (+ (* 21 v_~prev~0_389) (* 34 v_~cur~0_328) (* 3 v_~prev~0_388))) (= (+ v_~q~0_518 3) v_~q~0_517)) InVars {~j~0=v_~j~0_664, ~prev~0=v_~prev~0_389, ~i~0=v_~i~0_618, ~q~0=v_~q~0_518, ~p~0=v_~p~0_462, ~cur~0=v_~cur~0_328, ~x~0=v_~x~0_375} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_235|, ~j~0=v_~j~0_663, ~next~0=v_~next~0_198, ~prev~0=v_~prev~0_388, ~i~0=v_~i~0_617, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_310|, ~q~0=v_~q~0_517, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_349|, ~p~0=v_~p~0_461, ~cur~0=v_~cur~0_327, ~x~0=v_~x~0_374} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:51:06,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] L687-5-->L687-5: Formula: (and (= (+ v_~j~0_676 v_~j~0_675 v_~i~0_633) v_~i~0_631) (= v_~next~0_202 v_~cur~0_335) (= (+ v_~j~0_676 (* 3 v_~i~0_631)) (* v_~j~0_675 4)) (= (* 5 v_~prev~0_396) (+ (* 3 v_~next~0_202) (* v_~prev~0_397 13) (* 21 v_~cur~0_336))) (< v_~p~0_477 4) (= v_~q~0_529 (+ v_~q~0_530 3)) (< v_~q~0_530 3) (< v_~x~0_383 1) (= (+ 12 v_~x~0_383) v_~x~0_382) (= v_~p~0_475 (+ v_~p~0_477 2)) (= (+ (* 34 v_~cur~0_336) (* 3 v_~prev~0_396) (* 21 v_~prev~0_397)) (* 2 v_~next~0_202))) InVars {~j~0=v_~j~0_676, ~prev~0=v_~prev~0_397, ~i~0=v_~i~0_633, ~q~0=v_~q~0_530, ~p~0=v_~p~0_477, ~cur~0=v_~cur~0_336, ~x~0=v_~x~0_383} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_239|, ~j~0=v_~j~0_675, ~next~0=v_~next~0_202, ~prev~0=v_~prev~0_396, ~i~0=v_~i~0_631, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_318|, ~q~0=v_~q~0_529, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_355|, ~p~0=v_~p~0_475, ~cur~0=v_~cur~0_335, ~x~0=v_~x~0_382} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:51:06,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L687-5-->L687-5: Formula: (and (= (* 5 v_~prev~0_392) (+ (* 3 v_~next~0_200) (* 21 v_~cur~0_332) (* v_~prev~0_393 13))) (= v_~p~0_469 (+ v_~p~0_471 3)) (= (+ v_~q~0_526 3) v_~q~0_525) (= (+ v_~j~0_672 (* v_~j~0_671 2) v_~i~0_627) v_~i~0_625) (< v_~x~0_379 1) (= v_~next~0_200 v_~cur~0_331) (= (* v_~j~0_671 7) (+ v_~j~0_672 (* 3 v_~i~0_625))) (< v_~q~0_526 3) (< v_~p~0_471 3) (= (* 2 v_~next~0_200) (+ (* 21 v_~prev~0_393) (* 34 v_~cur~0_332) (* 3 v_~prev~0_392))) (= (+ 12 v_~x~0_379) v_~x~0_378)) InVars {~j~0=v_~j~0_672, ~prev~0=v_~prev~0_393, ~i~0=v_~i~0_627, ~q~0=v_~q~0_526, ~p~0=v_~p~0_471, ~cur~0=v_~cur~0_332, ~x~0=v_~x~0_379} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_237|, ~j~0=v_~j~0_671, ~next~0=v_~next~0_200, ~prev~0=v_~prev~0_392, ~i~0=v_~i~0_625, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_314|, ~q~0=v_~q~0_525, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_353|, ~p~0=v_~p~0_469, ~cur~0=v_~cur~0_331, ~x~0=v_~x~0_378} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:51:07,045 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:51:07,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3488 [2022-12-05 22:51:07,048 INFO L495 AbstractCegarLoop]: Abstraction has has 696 places, 2116 transitions, 89454 flow [2022-12-05 22:51:07,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 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:51:07,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:51:07,049 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:51:07,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-12-05 22:51:07,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:51:07,249 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:51:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:51:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 328350020, now seen corresponding path program 2 times [2022-12-05 22:51:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:51:07,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103837738] [2022-12-05 22:51:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:51:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:51:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:51:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103837738] [2022-12-05 22:51:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103837738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:51:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915475310] [2022-12-05 22:51:07,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:51:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:51:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:51:07,363 INFO L229 MonitoredProcess]: Starting monitored process 57 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:51:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-05 22:51:07,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:51:07,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:51:07,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-05 22:51:07,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:51:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:51:07,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:51:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:51:07,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915475310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:51:07,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:51:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-05 22:51:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139176879] [2022-12-05 22:51:07,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:51:07,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:51:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:51:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:51:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-12-05 22:51:07,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-05 22:51:07,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 2116 transitions, 89454 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:51:07,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:51:07,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-05 22:51:07,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:51:11,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:14,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:31,903 INFO L130 PetriNetUnfolder]: 8257/14489 cut-off events. [2022-12-05 22:51:31,903 INFO L131 PetriNetUnfolder]: For 4679583/4679583 co-relation queries the response was YES. [2022-12-05 22:51:32,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280935 conditions, 14489 events. 8257/14489 cut-off events. For 4679583/4679583 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 122228 event pairs, 1669 based on Foata normal form. 64/14551 useless extension candidates. Maximal degree in co-relation 280686. Up to 12152 conditions per place. [2022-12-05 22:51:32,171 INFO L137 encePairwiseOnDemand]: 11/64 looper letters, 1717 selfloop transitions, 604 changer transitions 62/2383 dead transitions. [2022-12-05 22:51:32,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 2383 transitions, 100241 flow [2022-12-05 22:51:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-05 22:51:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-05 22:51:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 253 transitions. [2022-12-05 22:51:32,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0859375 [2022-12-05 22:51:32,172 INFO L175 Difference]: Start difference. First operand has 696 places, 2116 transitions, 89454 flow. Second operand 46 states and 253 transitions. [2022-12-05 22:51:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 2383 transitions, 100241 flow [2022-12-05 22:52:08,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 2383 transitions, 100027 flow, removed 75 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:08,569 INFO L231 Difference]: Finished difference. Result has 743 places, 2138 transitions, 92324 flow [2022-12-05 22:52:08,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=89246, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=92324, PETRI_PLACES=743, PETRI_TRANSITIONS=2138} [2022-12-05 22:52:08,571 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 725 predicate places. [2022-12-05 22:52:08,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:08,571 INFO L89 Accepts]: Start accepts. Operand has 743 places, 2138 transitions, 92324 flow [2022-12-05 22:52:08,590 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:08,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:08,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 743 places, 2138 transitions, 92324 flow [2022-12-05 22:52:08,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 741 places, 2138 transitions, 92324 flow [2022-12-05 22:52:11,786 INFO L130 PetriNetUnfolder]: 1767/4907 cut-off events. [2022-12-05 22:52:11,786 INFO L131 PetriNetUnfolder]: For 1747891/1748748 co-relation queries the response was YES. [2022-12-05 22:52:11,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113644 conditions, 4907 events. 1767/4907 cut-off events. For 1747891/1748748 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 53347 event pairs, 25 based on Foata normal form. 100/5004 useless extension candidates. Maximal degree in co-relation 113394. Up to 2479 conditions per place. [2022-12-05 22:52:12,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 741 places, 2138 transitions, 92324 flow [2022-12-05 22:52:12,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 6468 [2022-12-05 22:52:12,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L687-5-->L695-5: Formula: (and (< v_~p~0_482 4) (= (* 5 v_~prev~0_400) (+ (* v_~prev~0_401 13) (* 21 v_~cur~0_340) (* 3 v_~next~0_204))) (= v_~p~0_481 (+ v_~p~0_482 2)) (= (+ 12 v_~x~0_387) v_~x~0_386) (< v_~q~0_535 2) (= v_~next~0_204 v_~cur~0_339) (< v_~x~0_387 1) (= (+ v_~j~0_679 v_~j~0_681 v_~i~0_638) (* 2 v_~i~0_637)) (= v_~q~0_533 (+ v_~q~0_535 4)) (= (* 2 v_~next~0_204) (+ (* 34 v_~cur~0_340) (* 3 v_~prev~0_400) (* 21 v_~prev~0_401))) (= (+ (* v_~j~0_681 5) (* v_~i~0_638 4)) v_~i~0_637)) InVars {~j~0=v_~j~0_681, ~prev~0=v_~prev~0_401, ~i~0=v_~i~0_638, ~q~0=v_~q~0_535, ~p~0=v_~p~0_482, ~cur~0=v_~cur~0_340, ~x~0=v_~x~0_387} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_241|, ~j~0=v_~j~0_679, ~next~0=v_~next~0_204, ~prev~0=v_~prev~0_400, ~i~0=v_~i~0_637, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_322|, ~q~0=v_~q~0_533, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_357|, ~p~0=v_~p~0_481, ~cur~0=v_~cur~0_339, ~x~0=v_~x~0_386} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:52:12,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] L687-5-->L695-5: Formula: (and (= (* 5 v_~prev~0_404) (+ (* v_~prev~0_405 13) (* 3 v_~next~0_206) (* 21 v_~cur~0_344))) (< v_~p~0_486 3) (= (+ v_~p~0_486 3) v_~p~0_485) (= (+ (* 21 v_~prev~0_405) (* 3 v_~prev~0_404) (* 34 v_~cur~0_344)) (* 2 v_~next~0_206)) (= (+ v_~j~0_687 (* v_~i~0_641 10)) (* v_~j~0_685 7)) (= (+ 12 v_~x~0_391) v_~x~0_390) (= v_~next~0_206 v_~cur~0_343) (= v_~q~0_539 (+ v_~q~0_541 4)) (< v_~x~0_391 1) (< v_~q~0_541 2) (= (+ v_~j~0_687 (* v_~j~0_685 2) v_~i~0_642) (* 3 v_~i~0_641))) InVars {~j~0=v_~j~0_687, ~prev~0=v_~prev~0_405, ~i~0=v_~i~0_642, ~q~0=v_~q~0_541, ~p~0=v_~p~0_486, ~cur~0=v_~cur~0_344, ~x~0=v_~x~0_391} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_243|, ~j~0=v_~j~0_685, ~next~0=v_~next~0_206, ~prev~0=v_~prev~0_404, ~i~0=v_~i~0_641, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_324|, ~q~0=v_~q~0_539, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_361|, ~p~0=v_~p~0_485, ~cur~0=v_~cur~0_343, ~x~0=v_~x~0_390} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:52:12,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] L687-5-->L695-5: Formula: (and (= (* 5 v_~prev~0_404) (+ (* v_~prev~0_405 13) (* 3 v_~next~0_206) (* 21 v_~cur~0_344))) (< v_~p~0_486 3) (= (+ v_~p~0_486 3) v_~p~0_485) (= (+ (* 21 v_~prev~0_405) (* 3 v_~prev~0_404) (* 34 v_~cur~0_344)) (* 2 v_~next~0_206)) (= (+ v_~j~0_687 (* v_~i~0_641 10)) (* v_~j~0_685 7)) (= (+ 12 v_~x~0_391) v_~x~0_390) (= v_~next~0_206 v_~cur~0_343) (= v_~q~0_539 (+ v_~q~0_541 4)) (< v_~x~0_391 1) (< v_~q~0_541 2) (= (+ v_~j~0_687 (* v_~j~0_685 2) v_~i~0_642) (* 3 v_~i~0_641))) InVars {~j~0=v_~j~0_687, ~prev~0=v_~prev~0_405, ~i~0=v_~i~0_642, ~q~0=v_~q~0_541, ~p~0=v_~p~0_486, ~cur~0=v_~cur~0_344, ~x~0=v_~x~0_391} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_243|, ~j~0=v_~j~0_685, ~next~0=v_~next~0_206, ~prev~0=v_~prev~0_404, ~i~0=v_~i~0_641, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_324|, ~q~0=v_~q~0_539, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_361|, ~p~0=v_~p~0_485, ~cur~0=v_~cur~0_343, ~x~0=v_~x~0_390} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [457] L687-5-->L687-5: Formula: (and (= v_~p~0_503 (+ v_~p~0_505 2)) (= (+ (* v_~j~0_711 2) v_~i~0_665) v_~i~0_663) (< v_~p~0_505 4)) InVars {~j~0=v_~j~0_711, ~i~0=v_~i~0_665, ~p~0=v_~p~0_505} OutVars{~j~0=v_~j~0_711, ~i~0=v_~i~0_663, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_336|, ~p~0=v_~p~0_503} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:52:13,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L687-5-->L687-5: Formula: (and (= (+ (* v_~prev~0_419 13) (* 3 v_~next~0_213) (* 21 v_~cur~0_357)) (* 5 v_~prev~0_418)) (= (+ 12 v_~x~0_405) v_~x~0_404) (= v_~p~0_513 (+ v_~p~0_515 3)) (= (+ v_~j~0_720 v_~i~0_675 (* v_~j~0_719 3)) (* 2 v_~i~0_673)) (= (+ (* 34 v_~cur~0_357) (* 21 v_~prev~0_419) (* 3 v_~prev~0_418)) (* 2 v_~next~0_213)) (= (+ v_~j~0_719 (* v_~i~0_675 4) (* v_~j~0_720 5)) v_~i~0_673) (< v_~q~0_568 2) (= v_~next~0_213 v_~cur~0_356) (< v_~x~0_405 1) (< v_~p~0_513 6) (= (+ v_~q~0_568 4) v_~q~0_567)) InVars {~j~0=v_~j~0_720, ~prev~0=v_~prev~0_419, ~i~0=v_~i~0_675, ~q~0=v_~q~0_568, ~p~0=v_~p~0_515, ~cur~0=v_~cur~0_357, ~x~0=v_~x~0_405} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_251|, ~j~0=v_~j~0_719, ~next~0=v_~next~0_213, ~prev~0=v_~prev~0_418, ~i~0=v_~i~0_673, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_342|, ~q~0=v_~q~0_567, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_381|, ~p~0=v_~p~0_513, ~cur~0=v_~cur~0_356, ~x~0=v_~x~0_404} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:52:13,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L687-5-->L687-5: Formula: (and (= v_~p~0_519 (+ v_~p~0_521 4)) (= (+ v_~q~0_572 4) v_~q~0_571) (< v_~p~0_519 6) (< v_~x~0_409 1) (= v_~next~0_215 v_~cur~0_360) (< v_~q~0_572 2) (= (+ v_~j~0_724 (* v_~i~0_679 10)) (* v_~j~0_723 17)) (= (* 2 v_~next~0_215) (+ (* 21 v_~prev~0_423) (* 34 v_~cur~0_361) (* 3 v_~prev~0_422))) (= (* 3 v_~i~0_679) (+ v_~j~0_724 (* v_~j~0_723 5) v_~i~0_681)) (= (* 5 v_~prev~0_422) (+ (* 3 v_~next~0_215) (* v_~prev~0_423 13) (* 21 v_~cur~0_361))) (= (+ 12 v_~x~0_409) v_~x~0_408)) InVars {~j~0=v_~j~0_724, ~prev~0=v_~prev~0_423, ~i~0=v_~i~0_681, ~q~0=v_~q~0_572, ~p~0=v_~p~0_521, ~cur~0=v_~cur~0_361, ~x~0=v_~x~0_409} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_253|, ~j~0=v_~j~0_723, ~next~0=v_~next~0_215, ~prev~0=v_~prev~0_422, ~i~0=v_~i~0_679, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_346|, ~q~0=v_~q~0_571, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_383|, ~p~0=v_~p~0_519, ~cur~0=v_~cur~0_360, ~x~0=v_~x~0_408} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:52:13,434 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-05 22:52:13,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4864 [2022-12-05 22:52:13,435 INFO L495 AbstractCegarLoop]: Abstraction has has 739 places, 2136 transitions, 92721 flow [2022-12-05 22:52:13,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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:52:13,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:13,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:13,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-05 22:52:13,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:13,636 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 17847340, now seen corresponding path program 1 times [2022-12-05 22:52:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:13,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101502916] [2022-12-05 22:52:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:13,699 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:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:13,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101502916] [2022-12-05 22:52:13,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101502916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:13,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:13,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953183021] [2022-12-05 22:52:13,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:13,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:13,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-05 22:52:13,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 2136 transitions, 92721 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:13,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:13,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-05 22:52:13,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:27,521 INFO L130 PetriNetUnfolder]: 8220/14413 cut-off events. [2022-12-05 22:52:27,521 INFO L131 PetriNetUnfolder]: For 4301874/4301874 co-relation queries the response was YES. [2022-12-05 22:52:27,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283324 conditions, 14413 events. 8220/14413 cut-off events. For 4301874/4301874 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 121526 event pairs, 2642 based on Foata normal form. 4/14415 useless extension candidates. Maximal degree in co-relation 283071. Up to 14268 conditions per place. [2022-12-05 22:52:27,811 INFO L137 encePairwiseOnDemand]: 26/73 looper letters, 2089 selfloop transitions, 64 changer transitions 9/2162 dead transitions. [2022-12-05 22:52:27,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 2162 transitions, 97689 flow [2022-12-05 22:52:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:52:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:52:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-05 22:52:27,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2493150684931507 [2022-12-05 22:52:27,813 INFO L175 Difference]: Start difference. First operand has 739 places, 2136 transitions, 92721 flow. Second operand 5 states and 91 transitions. [2022-12-05 22:52:27,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 2162 transitions, 97689 flow Received shutdown request... [2022-12-05 22:52:44,953 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:52:44,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-05 22:52:44,953 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-05 22:52:44,956 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:52:44,956 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:52:44,956 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:44,958 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:52:44,958 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:52:44,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:52:44 BasicIcfg [2022-12-05 22:52:44,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:52:44,978 INFO L158 Benchmark]: Toolchain (without parser) took 852517.80ms. Allocated memory was 233.8MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 208.0MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-05 22:52:44,979 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 233.8MB. Free memory is still 210.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:52:44,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.60ms. Allocated memory is still 233.8MB. Free memory was 208.0MB in the beginning and 187.5MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 22:52:44,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.27ms. Allocated memory is still 233.8MB. Free memory was 187.5MB in the beginning and 185.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:44,979 INFO L158 Benchmark]: Boogie Preprocessor took 15.35ms. Allocated memory is still 233.8MB. Free memory was 185.4MB in the beginning and 184.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:52:44,979 INFO L158 Benchmark]: RCFGBuilder took 382.91ms. Allocated memory is still 233.8MB. Free memory was 184.4MB in the beginning and 170.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 22:52:44,979 INFO L158 Benchmark]: TraceAbstraction took 851681.69ms. Allocated memory was 233.8MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 169.2MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-05 22:52:44,980 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 233.8MB. Free memory is still 210.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.60ms. Allocated memory is still 233.8MB. Free memory was 208.0MB in the beginning and 187.5MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.27ms. Allocated memory is still 233.8MB. Free memory was 187.5MB in the beginning and 185.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.35ms. Allocated memory is still 233.8MB. Free memory was 185.4MB in the beginning and 184.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 382.91ms. Allocated memory is still 233.8MB. Free memory was 184.4MB in the beginning and 170.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 851681.69ms. Allocated memory was 233.8MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 169.2MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 91 PlacesBefore, 18 PlacesAfterwards, 91 TransitionsBefore, 14 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 1109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1122, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1096, unknown conditional: 0, unknown unconditional: 1096] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1936, Positive conditional cache size: 0, Positive unconditional cache size: 1936, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 18 PlacesBefore, 18 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.3s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 42, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 21 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 204, Positive conditional cache size: 204, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.3s, 28 PlacesBefore, 28 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 236, Positive conditional cache size: 236, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.3s, 46 PlacesBefore, 46 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 9, independent conditional: 0, independent unconditional: 9, 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: 27, independent: 18, independent conditional: 18, 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): 347, Positive cache size: 347, Positive conditional cache size: 347, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 349, Positive conditional cache size: 349, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 51 PlacesBefore, 51 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 353, Positive conditional cache size: 353, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 120 TransitionsBefore, 120 TransitionsAfterwards, 444 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): 353, Positive cache size: 353, Positive conditional cache size: 353, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 80 PlacesBefore, 80 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 439, Positive conditional cache size: 439, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.6s, 99 PlacesBefore, 99 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 18, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 494, Positive conditional cache size: 494, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 107 PlacesBefore, 107 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 545, Positive cache size: 545, Positive conditional cache size: 545, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks [2022-12-05 22:52:44,993 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end Lipton Reduction Statistics: ReductionTime: 0.1s, 118 PlacesBefore, 118 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 647, Positive conditional cache size: 647, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 133 PlacesBefore, 133 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 850 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): 647, Positive cache size: 647, Positive conditional cache size: 647, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 128 PlacesBefore, 128 PlacesAfterwards, 264 TransitionsBefore, 264 TransitionsAfterwards, 798 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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): 694, Positive cache size: 694, Positive conditional cache size: 694, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 153 PlacesBefore, 153 PlacesAfterwards, 348 TransitionsBefore, 348 TransitionsAfterwards, 1040 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): 694, Positive cache size: 694, Positive conditional cache size: 694, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 178 PlacesBefore, 178 PlacesAfterwards, 418 TransitionsBefore, 418 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 797, Positive cache size: 797, Positive conditional cache size: 797, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 178 PlacesBefore, 178 PlacesAfterwards, 415 TransitionsBefore, 415 TransitionsAfterwards, 1248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 846, Positive conditional cache size: 846, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 184 PlacesBefore, 184 PlacesAfterwards, 420 TransitionsBefore, 420 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 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: 5, independent conditional: 0, independent unconditional: 5, 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: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 938, Positive conditional cache size: 938, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 202 PlacesBefore, 202 PlacesAfterwards, 481 TransitionsBefore, 481 TransitionsAfterwards, 1504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1031, Positive cache size: 1031, Positive conditional cache size: 1031, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 214 PlacesBefore, 214 PlacesAfterwards, 509 TransitionsBefore, 509 TransitionsAfterwards, 1556 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): 1031, Positive cache size: 1031, Positive conditional cache size: 1031, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 237 PlacesBefore, 237 PlacesAfterwards, 574 TransitionsBefore, 574 TransitionsAfterwards, 1724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 235 PlacesBefore, 235 PlacesAfterwards, 566 TransitionsBefore, 566 TransitionsAfterwards, 1750 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 238 PlacesBefore, 238 PlacesAfterwards, 560 TransitionsBefore, 560 TransitionsAfterwards, 1726 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 254 PlacesBefore, 254 PlacesAfterwards, 592 TransitionsBefore, 592 TransitionsAfterwards, 1814 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 276 PlacesBefore, 276 PlacesAfterwards, 695 TransitionsBefore, 695 TransitionsAfterwards, 2192 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 307 PlacesBefore, 307 PlacesAfterwards, 760 TransitionsBefore, 760 TransitionsAfterwards, 2428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1095, Positive cache size: 1095, Positive conditional cache size: 1095, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 298 PlacesBefore, 298 PlacesAfterwards, 782 TransitionsBefore, 782 TransitionsAfterwards, 2534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 34, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 34, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1159, Positive conditional cache size: 1159, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 300 PlacesBefore, 300 PlacesAfterwards, 777 TransitionsBefore, 777 TransitionsAfterwards, 2458 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): 1159, Positive cache size: 1159, Positive conditional cache size: 1159, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 308 PlacesBefore, 308 PlacesAfterwards, 834 TransitionsBefore, 834 TransitionsAfterwards, 2690 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): 1159, Positive cache size: 1159, Positive conditional cache size: 1159, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 342 PlacesBefore, 342 PlacesAfterwards, 895 TransitionsBefore, 895 TransitionsAfterwards, 2802 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1390, Positive cache size: 1390, Positive conditional cache size: 1390, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 335 PlacesBefore, 335 PlacesAfterwards, 843 TransitionsBefore, 843 TransitionsAfterwards, 2664 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): 1390, Positive cache size: 1390, Positive conditional cache size: 1390, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 365 PlacesBefore, 365 PlacesAfterwards, 909 TransitionsBefore, 909 TransitionsAfterwards, 2798 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, 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): 1447, Positive cache size: 1447, Positive conditional cache size: 1447, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 403 PlacesBefore, 403 PlacesAfterwards, 1045 TransitionsBefore, 1045 TransitionsAfterwards, 3176 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): 1447, Positive cache size: 1447, Positive conditional cache size: 1447, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 430 PlacesBefore, 430 PlacesAfterwards, 1111 TransitionsBefore, 1111 TransitionsAfterwards, 3324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1767, Positive cache size: 1767, Positive conditional cache size: 1767, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 458 PlacesBefore, 457 PlacesAfterwards, 1193 TransitionsBefore, 1192 TransitionsAfterwards, 3544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1784, Positive cache size: 1784, Positive conditional cache size: 1784, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 451 PlacesBefore, 451 PlacesAfterwards, 1181 TransitionsBefore, 1181 TransitionsAfterwards, 3526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1865, Positive cache size: 1865, Positive conditional cache size: 1865, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 476 PlacesBefore, 476 PlacesAfterwards, 1225 TransitionsBefore, 1225 TransitionsAfterwards, 3632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent conditional: 2, 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): 2003, Positive cache size: 2003, Positive conditional cache size: 2003, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 498 PlacesBefore, 496 PlacesAfterwards, 1264 TransitionsBefore, 1262 TransitionsAfterwards, 3716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2009, Positive cache size: 2009, Positive conditional cache size: 2009, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 523 PlacesBefore, 523 PlacesAfterwards, 1372 TransitionsBefore, 1372 TransitionsAfterwards, 3974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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): 2018, Positive cache size: 2018, Positive conditional cache size: 2018, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 540 PlacesBefore, 540 PlacesAfterwards, 1461 TransitionsBefore, 1461 TransitionsAfterwards, 4182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 2294, Positive cache size: 2294, Positive conditional cache size: 2294, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 570 PlacesBefore, 569 PlacesAfterwards, 1514 TransitionsBefore, 1513 TransitionsAfterwards, 4300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2411, Positive cache size: 2411, Positive conditional cache size: 2411, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 561 PlacesBefore, 561 PlacesAfterwards, 1503 TransitionsBefore, 1503 TransitionsAfterwards, 4538 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): 2411, Positive cache size: 2411, Positive conditional cache size: 2411, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 566 PlacesBefore, 566 PlacesAfterwards, 1503 TransitionsBefore, 1503 TransitionsAfterwards, 4560 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): 2411, Positive cache size: 2411, Positive conditional cache size: 2411, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 605 PlacesBefore, 604 PlacesAfterwards, 1560 TransitionsBefore, 1559 TransitionsAfterwards, 4654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2588, Positive conditional cache size: 2588, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 590 PlacesBefore, 590 PlacesAfterwards, 1557 TransitionsBefore, 1557 TransitionsAfterwards, 4754 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, 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): 2659, Positive cache size: 2659, Positive conditional cache size: 2659, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.9s, 591 PlacesBefore, 588 PlacesAfterwards, 1536 TransitionsBefore, 1532 TransitionsAfterwards, 4716 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 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: 15, independent conditional: 0, independent unconditional: 15, 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: 28, independent: 13, independent conditional: 13, independent unconditional: 0, 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): 3009, Positive cache size: 3009, Positive conditional cache size: 3009, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 579 PlacesBefore, 579 PlacesAfterwards, 1630 TransitionsBefore, 1630 TransitionsAfterwards, 4984 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): 3009, Positive cache size: 3009, Positive conditional cache size: 3009, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 609 PlacesBefore, 605 PlacesAfterwards, 1653 TransitionsBefore, 1649 TransitionsAfterwards, 5018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3200, Positive cache size: 3200, Positive conditional cache size: 3200, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 639 PlacesBefore, 639 PlacesAfterwards, 1775 TransitionsBefore, 1775 TransitionsAfterwards, 5320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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): 3256, Positive cache size: 3256, Positive conditional cache size: 3256, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 631 PlacesBefore, 631 PlacesAfterwards, 1772 TransitionsBefore, 1772 TransitionsAfterwards, 5316 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): 3256, Positive cache size: 3256, Positive conditional cache size: 3256, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.4s, 668 PlacesBefore, 666 PlacesAfterwards, 1796 TransitionsBefore, 1794 TransitionsAfterwards, 5374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 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] , 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3495, Positive cache size: 3495, Positive conditional cache size: 3495, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 649 PlacesBefore, 649 PlacesAfterwards, 1791 TransitionsBefore, 1791 TransitionsAfterwards, 5360 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): 3495, Positive cache size: 3495, Positive conditional cache size: 3495, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 703 PlacesBefore, 703 PlacesAfterwards, 2016 TransitionsBefore, 2016 TransitionsAfterwards, 6052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3648, Positive cache size: 3648, Positive conditional cache size: 3648, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 707 PlacesBefore, 707 PlacesAfterwards, 2156 TransitionsBefore, 2156 TransitionsAfterwards, 6514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3695, Positive cache size: 3695, Positive conditional cache size: 3695, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.7s, 699 PlacesBefore, 696 PlacesAfterwards, 2119 TransitionsBefore, 2116 TransitionsAfterwards, 6444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3742, Positive cache size: 3742, Positive conditional cache size: 3742, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 1.3s, 741 PlacesBefore, 739 PlacesAfterwards, 2138 TransitionsBefore, 2136 TransitionsAfterwards, 6468 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4091, Positive cache size: 4091, Positive conditional cache size: 4091, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 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: 851.6s, OverallIterations: 60, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 762.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 6566 SdHoareTripleChecker+Valid, 79.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6566 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 76.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7047 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21524 IncrementalHoareTripleChecker+Invalid, 28590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7047 mSolverCounterUnsat, 0 mSDtfsCounter, 21524 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 652 SyntacticMatches, 2 SemanticMatches, 1229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10301 ImplicationChecksByTransitivity, 106.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92721occurred in iteration=59, InterpolantAutomatonStates: 966, 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.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 1622 ConstructedInterpolants, 281 QuantifiedInterpolants, 37093 SizeOfPredicates, 34 NumberOfNonLiveVariables, 8864 ConjunctsInSsa, 750 ConjunctsInUnsatCore, 155 InterpolantComputations, 21 PerfectInterpolantSequences, 181/550 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown