/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:27:37,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:27:37,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:27:37,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:27:37,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:27:37,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:27:37,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:27:37,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:27:37,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:27:37,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:27:37,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:27:37,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:27:37,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:27:37,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:27:37,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:27:37,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:27:37,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:27:37,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:27:37,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:27:37,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:27:37,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:27:37,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:27:37,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:27:37,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:27:37,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:27:37,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:27:37,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:27:37,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:27:37,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:27:37,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:27:37,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:27:37,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:27:37,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:27:37,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:27:37,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:27:37,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:27:37,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:27:37,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:27:37,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:27:37,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:27:37,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:27:37,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:27:38,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:27:38,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:27:38,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:27:38,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:27:38,033 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:27:38,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:27:38,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:27:38,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:27:38,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:27:38,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:27:38,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:27:38,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:27:38,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:27:38,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:27:38,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:27:38,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:27:38,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:27:38,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:27:38,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:27:38,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:27:38,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:27:38,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:27:38,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:27:38,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:27:38,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:27:38,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:27:38,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:27:38,370 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:27:38,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2022-12-06 05:27:39,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:27:39,820 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:27:39,822 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2022-12-06 05:27:39,829 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d4687c7/e658dbc31be544e4b9fca9643754e659/FLAGb63dced50 [2022-12-06 05:27:39,850 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d4687c7/e658dbc31be544e4b9fca9643754e659 [2022-12-06 05:27:39,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:27:39,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:27:39,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:27:39,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:27:39,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:27:39,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:27:39" (1/1) ... [2022-12-06 05:27:39,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1d27ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:39, skipping insertion in model container [2022-12-06 05:27:39,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:27:39" (1/1) ... [2022-12-06 05:27:39,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:27:39,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:27:40,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:27:40,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:27:40,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:27:40,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:27:40,075 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c[2681,2694] [2022-12-06 05:27:40,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:27:40,103 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:27:40,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:27:40,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:27:40,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:27:40,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:27:40,136 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c[2681,2694] [2022-12-06 05:27:40,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:27:40,151 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:27:40,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40 WrapperNode [2022-12-06 05:27:40,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:27:40,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:27:40,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:27:40,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:27:40,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,194 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 193 [2022-12-06 05:27:40,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:27:40,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:27:40,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:27:40,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:27:40,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:27:40,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:27:40,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:27:40,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:27:40,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (1/1) ... [2022-12-06 05:27:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:27:40,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:27:40,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:27:40,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:27:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:27:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:27:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:27:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:27:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:27:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:27:40,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:27:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:27:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:27:40,330 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:27:40,461 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:27:40,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:27:40,761 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:27:40,947 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:27:40,948 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:27:40,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:27:40 BoogieIcfgContainer [2022-12-06 05:27:40,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:27:40,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:27:40,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:27:40,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:27:40,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:27:39" (1/3) ... [2022-12-06 05:27:40,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d68bb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:27:40, skipping insertion in model container [2022-12-06 05:27:40,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:27:40" (2/3) ... [2022-12-06 05:27:40,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d68bb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:27:40, skipping insertion in model container [2022-12-06 05:27:40,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:27:40" (3/3) ... [2022-12-06 05:27:40,957 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2022-12-06 05:27:40,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:27:40,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:27:40,972 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:27:41,032 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:27:41,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 150 transitions, 316 flow [2022-12-06 05:27:41,146 INFO L130 PetriNetUnfolder]: 13/148 cut-off events. [2022-12-06 05:27:41,146 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:27:41,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 13/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 05:27:41,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 150 transitions, 316 flow [2022-12-06 05:27:41,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 140 transitions, 292 flow [2022-12-06 05:27:41,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:41,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 140 transitions, 292 flow [2022-12-06 05:27:41,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 292 flow [2022-12-06 05:27:41,218 INFO L130 PetriNetUnfolder]: 13/140 cut-off events. [2022-12-06 05:27:41,219 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:27:41,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 13/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 05:27:41,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 140 transitions, 292 flow [2022-12-06 05:27:41,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 05:27:47,352 INFO L203 LiptonReduction]: Total number of compositions: 121 [2022-12-06 05:27:47,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:27:47,369 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;@1fc7abcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:27:47,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:27:47,374 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 05:27:47,374 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:27:47,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:47,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:47,375 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-06 05:27:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 723377221, now seen corresponding path program 1 times [2022-12-06 05:27:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403748282] [2022-12-06 05:27:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:47,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:47,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403748282] [2022-12-06 05:27:47,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403748282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:47,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:47,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:27:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565746381] [2022-12-06 05:27:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:27:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:27:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:27:47,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 05:27:47,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:47,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:47,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 05:27:47,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:47,839 INFO L130 PetriNetUnfolder]: 67/118 cut-off events. [2022-12-06 05:27:47,839 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:27:47,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 118 events. 67/118 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 312 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2022-12-06 05:27:47,842 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2022-12-06 05:27:47,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 29 transitions, 133 flow [2022-12-06 05:27:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:27:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:27:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:27:47,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 05:27:47,853 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:27:47,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 29 transitions, 133 flow [2022-12-06 05:27:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:27:47,857 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2022-12-06 05:27:47,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2022-12-06 05:27:47,862 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-06 05:27:47,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:47,863 INFO L89 Accepts]: Start accepts. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 05:27:47,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:47,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:47,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 05:27:47,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 05:27:47,876 INFO L130 PetriNetUnfolder]: 9/33 cut-off events. [2022-12-06 05:27:47,877 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:27:47,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 9/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 05:27:47,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 05:27:47,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 05:27:47,878 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:47,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:27:47,880 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2022-12-06 05:27:47,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:47,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:47,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:47,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:27:47,885 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-06 05:27:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1532126613, now seen corresponding path program 1 times [2022-12-06 05:27:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:47,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838040846] [2022-12-06 05:27:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:48,006 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-06 05:27:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838040846] [2022-12-06 05:27:48,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838040846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:48,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:48,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:27:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639968314] [2022-12-06 05:27:48,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:48,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:27:48,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:27:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:27:48,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:27:48,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:48,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:27:48,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:48,133 INFO L130 PetriNetUnfolder]: 94/179 cut-off events. [2022-12-06 05:27:48,133 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:27:48,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 179 events. 94/179 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 572 event pairs, 26 based on Foata normal form. 4/181 useless extension candidates. Maximal degree in co-relation 144. Up to 88 conditions per place. [2022-12-06 05:27:48,135 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 34 selfloop transitions, 4 changer transitions 8/46 dead transitions. [2022-12-06 05:27:48,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 46 transitions, 223 flow [2022-12-06 05:27:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:27:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:27:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 05:27:48,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2022-12-06 05:27:48,136 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 43 transitions. [2022-12-06 05:27:48,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 46 transitions, 223 flow [2022-12-06 05:27:48,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 46 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:27:48,138 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 85 flow [2022-12-06 05:27:48,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2022-12-06 05:27:48,139 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-06 05:27:48,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:48,139 INFO L89 Accepts]: Start accepts. Operand has 27 places, 23 transitions, 85 flow [2022-12-06 05:27:48,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:48,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:48,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 23 transitions, 85 flow [2022-12-06 05:27:48,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 85 flow [2022-12-06 05:27:48,146 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-06 05:27:48,146 INFO L131 PetriNetUnfolder]: For 5/8 co-relation queries the response was YES. [2022-12-06 05:27:48,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 37 events. 8/37 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-06 05:27:48,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 85 flow [2022-12-06 05:27:48,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:27:48,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:48,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 05:27:48,410 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 83 flow [2022-12-06 05:27:48,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:48,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:48,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:27:48,410 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-06 05:27:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1490964483, now seen corresponding path program 1 times [2022-12-06 05:27:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22459226] [2022-12-06 05:27:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:48,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22459226] [2022-12-06 05:27:48,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22459226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:48,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:48,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163771030] [2022-12-06 05:27:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:48,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:48,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:27:48,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:48,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:27:48,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:48,563 INFO L130 PetriNetUnfolder]: 79/149 cut-off events. [2022-12-06 05:27:48,563 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-06 05:27:48,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 149 events. 79/149 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 427 event pairs, 23 based on Foata normal form. 6/153 useless extension candidates. Maximal degree in co-relation 323. Up to 72 conditions per place. [2022-12-06 05:27:48,565 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 34 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-06 05:27:48,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 38 transitions, 209 flow [2022-12-06 05:27:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 05:27:48,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 05:27:48,567 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 83 flow. Second operand 4 states and 38 transitions. [2022-12-06 05:27:48,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 38 transitions, 209 flow [2022-12-06 05:27:48,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 188 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:48,569 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 94 flow [2022-12-06 05:27:48,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2022-12-06 05:27:48,570 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-06 05:27:48,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:48,570 INFO L89 Accepts]: Start accepts. Operand has 27 places, 24 transitions, 94 flow [2022-12-06 05:27:48,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:48,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:48,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 24 transitions, 94 flow [2022-12-06 05:27:48,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 94 flow [2022-12-06 05:27:48,576 INFO L130 PetriNetUnfolder]: 8/39 cut-off events. [2022-12-06 05:27:48,576 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:27:48,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 39 events. 8/39 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 44. Up to 12 conditions per place. [2022-12-06 05:27:48,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 94 flow [2022-12-06 05:27:48,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 05:27:48,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:48,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 05:27:48,685 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 88 flow [2022-12-06 05:27:48,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:48,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:48,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:27:48,686 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-06 05:27:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2133644839, now seen corresponding path program 1 times [2022-12-06 05:27:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:48,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777067723] [2022-12-06 05:27:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:48,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:48,743 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-06 05:27:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:48,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777067723] [2022-12-06 05:27:48,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777067723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:48,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:48,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249541636] [2022-12-06 05:27:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:48,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:27:48,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:48,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:27:48,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:48,816 INFO L130 PetriNetUnfolder]: 81/159 cut-off events. [2022-12-06 05:27:48,817 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-06 05:27:48,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 159 events. 81/159 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 31 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 181. Up to 113 conditions per place. [2022-12-06 05:27:48,818 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 34 selfloop transitions, 4 changer transitions 3/41 dead transitions. [2022-12-06 05:27:48,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 232 flow [2022-12-06 05:27:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:27:48,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-06 05:27:48,819 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 88 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:27:48,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 232 flow [2022-12-06 05:27:48,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 215 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:27:48,821 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 105 flow [2022-12-06 05:27:48,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-06 05:27:48,822 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2022-12-06 05:27:48,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:48,822 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 105 flow [2022-12-06 05:27:48,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:48,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:48,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 105 flow [2022-12-06 05:27:48,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 105 flow [2022-12-06 05:27:48,829 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-06 05:27:48,829 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 05:27:48,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 50 events. 11/50 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 67. Up to 16 conditions per place. [2022-12-06 05:27:48,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 105 flow [2022-12-06 05:27:48,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 05:27:48,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:48,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 05:27:48,936 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 110 flow [2022-12-06 05:27:48,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:48,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:48,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:27:48,936 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-06 05:27:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 15125948, now seen corresponding path program 1 times [2022-12-06 05:27:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902896106] [2022-12-06 05:27:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:49,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:49,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902896106] [2022-12-06 05:27:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902896106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:49,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:49,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614203835] [2022-12-06 05:27:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:49,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:49,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 05:27:49,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:49,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:49,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 05:27:49,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:49,113 INFO L130 PetriNetUnfolder]: 81/175 cut-off events. [2022-12-06 05:27:49,113 INFO L131 PetriNetUnfolder]: For 256/264 co-relation queries the response was YES. [2022-12-06 05:27:49,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 175 events. 81/175 cut-off events. For 256/264 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 560 event pairs, 44 based on Foata normal form. 9/179 useless extension candidates. Maximal degree in co-relation 258. Up to 148 conditions per place. [2022-12-06 05:27:49,115 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 23 selfloop transitions, 2 changer transitions 12/38 dead transitions. [2022-12-06 05:27:49,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 222 flow [2022-12-06 05:27:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 05:27:49,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2022-12-06 05:27:49,116 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 110 flow. Second operand 4 states and 41 transitions. [2022-12-06 05:27:49,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 222 flow [2022-12-06 05:27:49,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:27:49,118 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 120 flow [2022-12-06 05:27:49,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 05:27:49,119 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-06 05:27:49,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:49,119 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 120 flow [2022-12-06 05:27:49,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:49,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:49,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 120 flow [2022-12-06 05:27:49,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 120 flow [2022-12-06 05:27:49,126 INFO L130 PetriNetUnfolder]: 11/51 cut-off events. [2022-12-06 05:27:49,126 INFO L131 PetriNetUnfolder]: For 39/43 co-relation queries the response was YES. [2022-12-06 05:27:49,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 51 events. 11/51 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 1 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 101. Up to 16 conditions per place. [2022-12-06 05:27:49,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 120 flow [2022-12-06 05:27:49,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 05:27:49,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:49,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 838 [2022-12-06 05:27:49,958 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 116 flow [2022-12-06 05:27:49,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:49,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:49,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:49,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:27:49,958 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-06 05:27:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1341936530, now seen corresponding path program 1 times [2022-12-06 05:27:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:49,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970668786] [2022-12-06 05:27:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970668786] [2022-12-06 05:27:49,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970668786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:49,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:49,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:49,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442457072] [2022-12-06 05:27:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:49,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:27:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:49,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:27:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:27:49,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 05:27:49,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:49,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:49,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 05:27:49,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:50,052 INFO L130 PetriNetUnfolder]: 65/128 cut-off events. [2022-12-06 05:27:50,052 INFO L131 PetriNetUnfolder]: For 152/156 co-relation queries the response was YES. [2022-12-06 05:27:50,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 128 events. 65/128 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 346 event pairs, 17 based on Foata normal form. 5/130 useless extension candidates. Maximal degree in co-relation 389. Up to 100 conditions per place. [2022-12-06 05:27:50,053 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 24 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2022-12-06 05:27:50,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 199 flow [2022-12-06 05:27:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:27:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:27:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 05:27:50,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 05:27:50,064 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 116 flow. Second operand 3 states and 33 transitions. [2022-12-06 05:27:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 199 flow [2022-12-06 05:27:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 187 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:50,068 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 102 flow [2022-12-06 05:27:50,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 05:27:50,069 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 05:27:50,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:50,069 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 102 flow [2022-12-06 05:27:50,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:50,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:50,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 102 flow [2022-12-06 05:27:50,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 102 flow [2022-12-06 05:27:50,075 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2022-12-06 05:27:50,075 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:27:50,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 35 events. 9/35 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2022-12-06 05:27:50,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 102 flow [2022-12-06 05:27:50,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 05:27:50,076 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:50,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:27:50,077 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 102 flow [2022-12-06 05:27:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:50,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:50,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:50,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:27:50,077 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-06 05:27:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1896862322, now seen corresponding path program 1 times [2022-12-06 05:27:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:50,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584751881] [2022-12-06 05:27:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584751881] [2022-12-06 05:27:50,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584751881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:50,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:50,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525197262] [2022-12-06 05:27:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:50,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:50,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:27:50,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:50,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:50,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:27:50,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:50,179 INFO L130 PetriNetUnfolder]: 54/99 cut-off events. [2022-12-06 05:27:50,179 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-06 05:27:50,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 99 events. 54/99 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 204 event pairs, 20 based on Foata normal form. 6/103 useless extension candidates. Maximal degree in co-relation 190. Up to 84 conditions per place. [2022-12-06 05:27:50,180 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-06 05:27:50,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 189 flow [2022-12-06 05:27:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 05:27:50,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 05:27:50,181 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 102 flow. Second operand 4 states and 32 transitions. [2022-12-06 05:27:50,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 189 flow [2022-12-06 05:27:50,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 178 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:27:50,182 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 105 flow [2022-12-06 05:27:50,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 05:27:50,183 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2022-12-06 05:27:50,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:50,183 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 105 flow [2022-12-06 05:27:50,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:50,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:50,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 105 flow [2022-12-06 05:27:50,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 105 flow [2022-12-06 05:27:50,188 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 05:27:50,188 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-12-06 05:27:50,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 31 events. 9/31 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 48. Up to 12 conditions per place. [2022-12-06 05:27:50,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 105 flow [2022-12-06 05:27:50,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 05:27:50,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] $Ultimate##0-->L60-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [696] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_195| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~counter~0_194 4))))) (and (not (= (ite (and (<= 0 v_~counter~0_194) (< v_~counter~0_194 v_~n~0_96)) 1 0) 0)) (= (ite (= v_~counter~0_194 (select (select |v_#memory_int_195| v_~f_inv~0.base_110) (+ v_~f_inv~0.offset_110 (* .cse0 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (< 0 v_~N~0_51) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= (ite |v_thread1_#t~short4#1_95| 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_31| 1) |v_thread1_#t~short4#1_96| (= v_~counter~0_193 .cse0) (< .cse0 v_~n_inv~0_90))) InVars {~counter~0=v_~counter~0_194, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_195|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~n~0=v_~n~0_96, ~f~0.offset=v_~f~0.offset_104, ~n_inv~0=v_~n_inv~0_90} OutVars{~counter~0=v_~counter~0_193, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_19|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_19|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_19|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~f~0.offset=v_~f~0.offset_104, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_19|, #memory_int=|v_#memory_int_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_23|, ~n~0=v_~n~0_96, ~n_inv~0=v_~n_inv~0_90} AuxVars[|v_thread1_#t~short4#1_95|, |v_thread1_#t~short4#1_96|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:27:50,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:50,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 05:27:50,303 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 101 flow [2022-12-06 05:27:50,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:50,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:50,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:50,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:27:50,303 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-06 05:27:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1978054019, now seen corresponding path program 1 times [2022-12-06 05:27:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:50,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720879425] [2022-12-06 05:27:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:50,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720879425] [2022-12-06 05:27:50,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720879425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:50,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:50,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153258838] [2022-12-06 05:27:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:50,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:50,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:27:50,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:50,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:50,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:27:50,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:50,446 INFO L130 PetriNetUnfolder]: 52/99 cut-off events. [2022-12-06 05:27:50,446 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 05:27:50,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 99 events. 52/99 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 193 event pairs, 22 based on Foata normal form. 8/104 useless extension candidates. Maximal degree in co-relation 251. Up to 94 conditions per place. [2022-12-06 05:27:50,447 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 22 selfloop transitions, 2 changer transitions 5/29 dead transitions. [2022-12-06 05:27:50,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 173 flow [2022-12-06 05:27:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 05:27:50,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2022-12-06 05:27:50,448 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 101 flow. Second operand 4 states and 31 transitions. [2022-12-06 05:27:50,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 173 flow [2022-12-06 05:27:50,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 159 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:27:50,449 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 105 flow [2022-12-06 05:27:50,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 05:27:50,450 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 05:27:50,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:50,450 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 105 flow [2022-12-06 05:27:50,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:50,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:50,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 105 flow [2022-12-06 05:27:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 105 flow [2022-12-06 05:27:50,455 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 05:27:50,456 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 05:27:50,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 31 events. 9/31 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 58. Up to 12 conditions per place. [2022-12-06 05:27:50,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 105 flow [2022-12-06 05:27:50,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 05:27:50,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:50,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-06 05:27:50,740 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 101 flow [2022-12-06 05:27:50,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:50,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:50,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:50,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:27:50,741 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-06 05:27:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2000341769, now seen corresponding path program 1 times [2022-12-06 05:27:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:50,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998306641] [2022-12-06 05:27:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:50,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998306641] [2022-12-06 05:27:50,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998306641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:50,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:50,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889468864] [2022-12-06 05:27:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:50,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:27:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:27:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:27:50,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:27:50,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 101 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:50,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:50,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:27:50,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:51,126 INFO L130 PetriNetUnfolder]: 171/309 cut-off events. [2022-12-06 05:27:51,126 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-12-06 05:27:51,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 309 events. 171/309 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1113 event pairs, 18 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 540. Up to 133 conditions per place. [2022-12-06 05:27:51,129 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 53 selfloop transitions, 20 changer transitions 5/78 dead transitions. [2022-12-06 05:27:51,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 78 transitions, 459 flow [2022-12-06 05:27:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:27:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:27:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 05:27:51,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:27:51,130 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 101 flow. Second operand 7 states and 77 transitions. [2022-12-06 05:27:51,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 78 transitions, 459 flow [2022-12-06 05:27:51,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 78 transitions, 425 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 05:27:51,132 INFO L231 Difference]: Finished difference. Result has 34 places, 42 transitions, 270 flow [2022-12-06 05:27:51,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=34, PETRI_TRANSITIONS=42} [2022-12-06 05:27:51,133 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 12 predicate places. [2022-12-06 05:27:51,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:51,133 INFO L89 Accepts]: Start accepts. Operand has 34 places, 42 transitions, 270 flow [2022-12-06 05:27:51,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:51,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:51,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 42 transitions, 270 flow [2022-12-06 05:27:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 42 transitions, 270 flow [2022-12-06 05:27:51,144 INFO L130 PetriNetUnfolder]: 25/94 cut-off events. [2022-12-06 05:27:51,144 INFO L131 PetriNetUnfolder]: For 49/51 co-relation queries the response was YES. [2022-12-06 05:27:51,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 94 events. 25/94 cut-off events. For 49/51 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 322 event pairs, 0 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 143. Up to 36 conditions per place. [2022-12-06 05:27:51,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 42 transitions, 270 flow [2022-12-06 05:27:51,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 05:27:53,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:53,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2730 [2022-12-06 05:27:53,863 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-06 05:27:53,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:53,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:53,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:53,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:27:53,864 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-06 05:27:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1863967645, now seen corresponding path program 1 times [2022-12-06 05:27:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:53,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140255699] [2022-12-06 05:27:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:54,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140255699] [2022-12-06 05:27:54,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140255699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:54,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:54,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377300343] [2022-12-06 05:27:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:27:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:27:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:27:54,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:27:54,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-06 05:27:54,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:54,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:27:54,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:54,265 INFO L130 PetriNetUnfolder]: 431/777 cut-off events. [2022-12-06 05:27:54,265 INFO L131 PetriNetUnfolder]: For 1071/1071 co-relation queries the response was YES. [2022-12-06 05:27:54,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 777 events. 431/777 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3602 event pairs, 82 based on Foata normal form. 5/777 useless extension candidates. Maximal degree in co-relation 1644. Up to 327 conditions per place. [2022-12-06 05:27:54,270 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 67 selfloop transitions, 31 changer transitions 14/112 dead transitions. [2022-12-06 05:27:54,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 112 transitions, 891 flow [2022-12-06 05:27:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:27:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:27:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 05:27:54,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2022-12-06 05:27:54,271 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 7 states and 73 transitions. [2022-12-06 05:27:54,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 112 transitions, 891 flow [2022-12-06 05:27:54,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 112 transitions, 843 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-06 05:27:54,275 INFO L231 Difference]: Finished difference. Result has 45 places, 67 transitions, 595 flow [2022-12-06 05:27:54,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=45, PETRI_TRANSITIONS=67} [2022-12-06 05:27:54,276 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 23 predicate places. [2022-12-06 05:27:54,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:54,276 INFO L89 Accepts]: Start accepts. Operand has 45 places, 67 transitions, 595 flow [2022-12-06 05:27:54,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:54,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:54,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 67 transitions, 595 flow [2022-12-06 05:27:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 67 transitions, 595 flow [2022-12-06 05:27:54,304 INFO L130 PetriNetUnfolder]: 46/187 cut-off events. [2022-12-06 05:27:54,304 INFO L131 PetriNetUnfolder]: For 205/211 co-relation queries the response was YES. [2022-12-06 05:27:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 187 events. 46/187 cut-off events. For 205/211 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 954 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 404. Up to 50 conditions per place. [2022-12-06 05:27:54,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 67 transitions, 595 flow [2022-12-06 05:27:54,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 05:27:54,307 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:54,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 05:27:54,308 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 67 transitions, 595 flow [2022-12-06 05:27:54,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-06 05:27:54,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:54,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:54,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:27:54,308 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-06 05:27:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1865965636, now seen corresponding path program 1 times [2022-12-06 05:27:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:54,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132513725] [2022-12-06 05:27:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:54,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132513725] [2022-12-06 05:27:54,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132513725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:54,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:54,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:27:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051673684] [2022-12-06 05:27:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:54,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:27:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:54,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:27:54,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:27:54,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:27:54,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 67 transitions, 595 flow. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:54,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:54,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:27:54,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:55,348 INFO L130 PetriNetUnfolder]: 446/811 cut-off events. [2022-12-06 05:27:55,348 INFO L131 PetriNetUnfolder]: For 2017/2017 co-relation queries the response was YES. [2022-12-06 05:27:55,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 811 events. 446/811 cut-off events. For 2017/2017 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3840 event pairs, 111 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 2356. Up to 661 conditions per place. [2022-12-06 05:27:55,353 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 76 selfloop transitions, 29 changer transitions 10/115 dead transitions. [2022-12-06 05:27:55,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 115 transitions, 1090 flow [2022-12-06 05:27:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:27:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:27:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-12-06 05:27:55,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33816425120772947 [2022-12-06 05:27:55,355 INFO L175 Difference]: Start difference. First operand has 44 places, 67 transitions, 595 flow. Second operand 9 states and 70 transitions. [2022-12-06 05:27:55,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 115 transitions, 1090 flow [2022-12-06 05:27:55,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 115 transitions, 1062 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 05:27:55,362 INFO L231 Difference]: Finished difference. Result has 58 places, 85 transitions, 855 flow [2022-12-06 05:27:55,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=855, PETRI_PLACES=58, PETRI_TRANSITIONS=85} [2022-12-06 05:27:55,362 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 36 predicate places. [2022-12-06 05:27:55,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:55,363 INFO L89 Accepts]: Start accepts. Operand has 58 places, 85 transitions, 855 flow [2022-12-06 05:27:55,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:55,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:55,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 85 transitions, 855 flow [2022-12-06 05:27:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 85 transitions, 855 flow [2022-12-06 05:27:55,390 INFO L130 PetriNetUnfolder]: 58/229 cut-off events. [2022-12-06 05:27:55,390 INFO L131 PetriNetUnfolder]: For 454/461 co-relation queries the response was YES. [2022-12-06 05:27:55,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 229 events. 58/229 cut-off events. For 454/461 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1282 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 632. Up to 57 conditions per place. [2022-12-06 05:27:55,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 85 transitions, 855 flow [2022-12-06 05:27:55,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 05:27:58,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_195| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~counter~0_194 4))))) (and (not (= (ite (and (<= 0 v_~counter~0_194) (< v_~counter~0_194 v_~n~0_96)) 1 0) 0)) (= (ite (= v_~counter~0_194 (select (select |v_#memory_int_195| v_~f_inv~0.base_110) (+ v_~f_inv~0.offset_110 (* .cse0 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (< 0 v_~N~0_51) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= (ite |v_thread1_#t~short4#1_95| 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_31| 1) |v_thread1_#t~short4#1_96| (= v_~counter~0_193 .cse0) (< .cse0 v_~n_inv~0_90))) InVars {~counter~0=v_~counter~0_194, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_195|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~n~0=v_~n~0_96, ~f~0.offset=v_~f~0.offset_104, ~n_inv~0=v_~n_inv~0_90} OutVars{~counter~0=v_~counter~0_193, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_19|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_19|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_19|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~f~0.offset=v_~f~0.offset_104, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_19|, #memory_int=|v_#memory_int_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_23|, ~n~0=v_~n~0_96, ~n_inv~0=v_~n_inv~0_90} AuxVars[|v_thread1_#t~short4#1_95|, |v_thread1_#t~short4#1_96|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] and [672] L82-4-->L83-3: Formula: (and (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#memory_int_181| (store |v_#memory_int_182| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_182| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre22#1_31|))) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre22#1_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_182|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_31|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_181|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_31|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 05:27:58,328 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:27:58,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2966 [2022-12-06 05:27:58,329 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 85 transitions, 883 flow [2022-12-06 05:27:58,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:58,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:58,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:58,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:27:58,330 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-06 05:27:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 948701380, now seen corresponding path program 1 times [2022-12-06 05:27:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730743513] [2022-12-06 05:27:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:27:58,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730743513] [2022-12-06 05:27:58,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730743513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:58,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:27:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694416628] [2022-12-06 05:27:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:27:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:27:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:27:58,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:27:58,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 85 transitions, 883 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:58,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:58,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:27:58,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:58,709 INFO L130 PetriNetUnfolder]: 783/1447 cut-off events. [2022-12-06 05:27:58,709 INFO L131 PetriNetUnfolder]: For 4441/4441 co-relation queries the response was YES. [2022-12-06 05:27:58,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5806 conditions, 1447 events. 783/1447 cut-off events. For 4441/4441 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8150 event pairs, 204 based on Foata normal form. 12/1457 useless extension candidates. Maximal degree in co-relation 4586. Up to 780 conditions per place. [2022-12-06 05:27:58,718 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 101 selfloop transitions, 62 changer transitions 10/173 dead transitions. [2022-12-06 05:27:58,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 173 transitions, 1967 flow [2022-12-06 05:27:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:27:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:27:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-06 05:27:58,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-06 05:27:58,719 INFO L175 Difference]: Start difference. First operand has 58 places, 85 transitions, 883 flow. Second operand 6 states and 58 transitions. [2022-12-06 05:27:58,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 173 transitions, 1967 flow [2022-12-06 05:27:58,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 173 transitions, 1931 flow, removed 18 selfloop flow, removed 0 redundant places. [2022-12-06 05:27:58,734 INFO L231 Difference]: Finished difference. Result has 66 places, 129 transitions, 1531 flow [2022-12-06 05:27:58,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=66, PETRI_TRANSITIONS=129} [2022-12-06 05:27:58,736 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 44 predicate places. [2022-12-06 05:27:58,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:58,736 INFO L89 Accepts]: Start accepts. Operand has 66 places, 129 transitions, 1531 flow [2022-12-06 05:27:58,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:58,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:58,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 129 transitions, 1531 flow [2022-12-06 05:27:58,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 129 transitions, 1531 flow [2022-12-06 05:27:58,798 INFO L130 PetriNetUnfolder]: 135/487 cut-off events. [2022-12-06 05:27:58,798 INFO L131 PetriNetUnfolder]: For 1427/1451 co-relation queries the response was YES. [2022-12-06 05:27:58,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 487 events. 135/487 cut-off events. For 1427/1451 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3473 event pairs, 18 based on Foata normal form. 13/479 useless extension candidates. Maximal degree in co-relation 1738. Up to 160 conditions per place. [2022-12-06 05:27:58,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 129 transitions, 1531 flow [2022-12-06 05:27:58,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 05:27:58,804 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:58,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 05:27:58,806 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 129 transitions, 1531 flow [2022-12-06 05:27:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:58,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:58,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:58,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:27:58,807 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-06 05:27:58,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1822984619, now seen corresponding path program 1 times [2022-12-06 05:27:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:58,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636810209] [2022-12-06 05:27:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:59,511 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-06 05:27:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:59,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636810209] [2022-12-06 05:27:59,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636810209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:27:59,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823398277] [2022-12-06 05:27:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:59,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:27:59,515 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-06 05:27:59,527 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-06 05:27:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:59,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:27:59,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:27:59,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-06 05:27:59,856 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:27:59,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 36 [2022-12-06 05:27:59,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-12-06 05:27:59,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 05:27:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:27:59,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:27:59,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823398277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:59,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:27:59,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-06 05:27:59,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777127229] [2022-12-06 05:27:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:59,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:27:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:27:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:27:59,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:27:59,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 129 transitions, 1531 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:59,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:59,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:27:59,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:00,360 INFO L130 PetriNetUnfolder]: 985/1841 cut-off events. [2022-12-06 05:28:00,360 INFO L131 PetriNetUnfolder]: For 7372/7372 co-relation queries the response was YES. [2022-12-06 05:28:00,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8938 conditions, 1841 events. 985/1841 cut-off events. For 7372/7372 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11081 event pairs, 217 based on Foata normal form. 3/1841 useless extension candidates. Maximal degree in co-relation 7821. Up to 1124 conditions per place. [2022-12-06 05:28:00,374 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 112 selfloop transitions, 90 changer transitions 4/206 dead transitions. [2022-12-06 05:28:00,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 206 transitions, 2636 flow [2022-12-06 05:28:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:28:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:28:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 05:28:00,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37714285714285717 [2022-12-06 05:28:00,376 INFO L175 Difference]: Start difference. First operand has 65 places, 129 transitions, 1531 flow. Second operand 7 states and 66 transitions. [2022-12-06 05:28:00,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 206 transitions, 2636 flow [2022-12-06 05:28:00,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 206 transitions, 2486 flow, removed 75 selfloop flow, removed 1 redundant places. [2022-12-06 05:28:00,422 INFO L231 Difference]: Finished difference. Result has 73 places, 171 transitions, 2274 flow [2022-12-06 05:28:00,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2274, PETRI_PLACES=73, PETRI_TRANSITIONS=171} [2022-12-06 05:28:00,423 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 51 predicate places. [2022-12-06 05:28:00,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:00,423 INFO L89 Accepts]: Start accepts. Operand has 73 places, 171 transitions, 2274 flow [2022-12-06 05:28:00,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:00,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:00,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 171 transitions, 2274 flow [2022-12-06 05:28:00,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 171 transitions, 2274 flow [2022-12-06 05:28:00,506 INFO L130 PetriNetUnfolder]: 177/631 cut-off events. [2022-12-06 05:28:00,506 INFO L131 PetriNetUnfolder]: For 2314/2341 co-relation queries the response was YES. [2022-12-06 05:28:00,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 631 events. 177/631 cut-off events. For 2314/2341 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4813 event pairs, 27 based on Foata normal form. 12/614 useless extension candidates. Maximal degree in co-relation 2174. Up to 216 conditions per place. [2022-12-06 05:28:00,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 171 transitions, 2274 flow [2022-12-06 05:28:00,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 05:28:00,515 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:00,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 05:28:00,517 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 171 transitions, 2274 flow [2022-12-06 05:28:00,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:00,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:00,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:00,527 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-06 05:28:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 05:28:00,724 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-06 05:28:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2143642745, now seen corresponding path program 1 times [2022-12-06 05:28:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:00,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964727400] [2022-12-06 05:28:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964727400] [2022-12-06 05:28:01,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964727400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:01,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:01,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:28:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095851664] [2022-12-06 05:28:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:28:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:28:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:28:01,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:01,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 171 transitions, 2274 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:01,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:01,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:01,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:01,738 INFO L130 PetriNetUnfolder]: 1057/1982 cut-off events. [2022-12-06 05:28:01,739 INFO L131 PetriNetUnfolder]: For 10492/10492 co-relation queries the response was YES. [2022-12-06 05:28:01,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10269 conditions, 1982 events. 1057/1982 cut-off events. For 10492/10492 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12210 event pairs, 299 based on Foata normal form. 3/1982 useless extension candidates. Maximal degree in co-relation 8249. Up to 1481 conditions per place. [2022-12-06 05:28:01,752 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 135 selfloop transitions, 35 changer transitions 40/210 dead transitions. [2022-12-06 05:28:01,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 210 transitions, 3025 flow [2022-12-06 05:28:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:28:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:28:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 05:28:01,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 05:28:01,753 INFO L175 Difference]: Start difference. First operand has 73 places, 171 transitions, 2274 flow. Second operand 7 states and 55 transitions. [2022-12-06 05:28:01,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 210 transitions, 3025 flow [2022-12-06 05:28:01,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 210 transitions, 2993 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 05:28:01,790 INFO L231 Difference]: Finished difference. Result has 81 places, 159 transitions, 2153 flow [2022-12-06 05:28:01,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2153, PETRI_PLACES=81, PETRI_TRANSITIONS=159} [2022-12-06 05:28:01,791 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 59 predicate places. [2022-12-06 05:28:01,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:01,791 INFO L89 Accepts]: Start accepts. Operand has 81 places, 159 transitions, 2153 flow [2022-12-06 05:28:01,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:01,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:01,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 159 transitions, 2153 flow [2022-12-06 05:28:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 159 transitions, 2153 flow [2022-12-06 05:28:01,863 INFO L130 PetriNetUnfolder]: 149/553 cut-off events. [2022-12-06 05:28:01,863 INFO L131 PetriNetUnfolder]: For 2476/2500 co-relation queries the response was YES. [2022-12-06 05:28:01,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2411 conditions, 553 events. 149/553 cut-off events. For 2476/2500 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4128 event pairs, 22 based on Foata normal form. 11/541 useless extension candidates. Maximal degree in co-relation 2148. Up to 174 conditions per place. [2022-12-06 05:28:01,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 159 transitions, 2153 flow [2022-12-06 05:28:01,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 05:28:01,873 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:01,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 05:28:01,874 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 159 transitions, 2153 flow [2022-12-06 05:28:01,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:01,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:01,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:01,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:28:01,874 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-06 05:28:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash 533509889, now seen corresponding path program 1 times [2022-12-06 05:28:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:01,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860018205] [2022-12-06 05:28:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:01,943 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-06 05:28:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860018205] [2022-12-06 05:28:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860018205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:01,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:01,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:28:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451815899] [2022-12-06 05:28:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:01,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:28:01,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:01,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 159 transitions, 2153 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:01,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:01,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:01,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:02,313 INFO L130 PetriNetUnfolder]: 875/1682 cut-off events. [2022-12-06 05:28:02,313 INFO L131 PetriNetUnfolder]: For 9062/9062 co-relation queries the response was YES. [2022-12-06 05:28:02,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8761 conditions, 1682 events. 875/1682 cut-off events. For 9062/9062 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10160 event pairs, 291 based on Foata normal form. 12/1691 useless extension candidates. Maximal degree in co-relation 7869. Up to 880 conditions per place. [2022-12-06 05:28:02,327 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 131 selfloop transitions, 69 changer transitions 1/201 dead transitions. [2022-12-06 05:28:02,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 201 transitions, 2984 flow [2022-12-06 05:28:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:28:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:28:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:28:02,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 05:28:02,328 INFO L175 Difference]: Start difference. First operand has 81 places, 159 transitions, 2153 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:28:02,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 201 transitions, 2984 flow [2022-12-06 05:28:02,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 201 transitions, 2883 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-06 05:28:02,364 INFO L231 Difference]: Finished difference. Result has 85 places, 165 transitions, 2333 flow [2022-12-06 05:28:02,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2333, PETRI_PLACES=85, PETRI_TRANSITIONS=165} [2022-12-06 05:28:02,365 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 63 predicate places. [2022-12-06 05:28:02,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:02,365 INFO L89 Accepts]: Start accepts. Operand has 85 places, 165 transitions, 2333 flow [2022-12-06 05:28:02,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:02,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:02,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 165 transitions, 2333 flow [2022-12-06 05:28:02,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 165 transitions, 2333 flow [2022-12-06 05:28:02,434 INFO L130 PetriNetUnfolder]: 152/573 cut-off events. [2022-12-06 05:28:02,434 INFO L131 PetriNetUnfolder]: For 2566/2594 co-relation queries the response was YES. [2022-12-06 05:28:02,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 573 events. 152/573 cut-off events. For 2566/2594 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4322 event pairs, 22 based on Foata normal form. 10/559 useless extension candidates. Maximal degree in co-relation 2395. Up to 187 conditions per place. [2022-12-06 05:28:02,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 165 transitions, 2333 flow [2022-12-06 05:28:02,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-06 05:28:02,442 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:02,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 05:28:02,442 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 165 transitions, 2333 flow [2022-12-06 05:28:02,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:02,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:02,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:02,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:28:02,443 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-06 05:28:02,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1085654711, now seen corresponding path program 1 times [2022-12-06 05:28:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:02,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694685415] [2022-12-06 05:28:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:02,507 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-06 05:28:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694685415] [2022-12-06 05:28:02,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694685415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957025031] [2022-12-06 05:28:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:02,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:02,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:02,510 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-06 05:28:02,512 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-06 05:28:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:02,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:28:02,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:02,656 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-06 05:28:02,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:02,679 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-06 05:28:02,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957025031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:28:02,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:28:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 05:28:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276589867] [2022-12-06 05:28:02,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:28:02,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:28:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:28:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:28:02,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:02,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 165 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:02,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:02,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:03,147 INFO L130 PetriNetUnfolder]: 897/1718 cut-off events. [2022-12-06 05:28:03,147 INFO L131 PetriNetUnfolder]: For 10198/10198 co-relation queries the response was YES. [2022-12-06 05:28:03,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9324 conditions, 1718 events. 897/1718 cut-off events. For 10198/10198 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10477 event pairs, 188 based on Foata normal form. 36/1751 useless extension candidates. Maximal degree in co-relation 8598. Up to 747 conditions per place. [2022-12-06 05:28:03,166 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 148 selfloop transitions, 70 changer transitions 0/218 dead transitions. [2022-12-06 05:28:03,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 218 transitions, 3308 flow [2022-12-06 05:28:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:28:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:28:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-06 05:28:03,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3485714285714286 [2022-12-06 05:28:03,168 INFO L175 Difference]: Start difference. First operand has 85 places, 165 transitions, 2333 flow. Second operand 7 states and 61 transitions. [2022-12-06 05:28:03,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 218 transitions, 3308 flow [2022-12-06 05:28:03,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 218 transitions, 3226 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-06 05:28:03,213 INFO L231 Difference]: Finished difference. Result has 91 places, 170 transitions, 2506 flow [2022-12-06 05:28:03,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=91, PETRI_TRANSITIONS=170} [2022-12-06 05:28:03,214 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 69 predicate places. [2022-12-06 05:28:03,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:03,215 INFO L89 Accepts]: Start accepts. Operand has 91 places, 170 transitions, 2506 flow [2022-12-06 05:28:03,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:03,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:03,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 170 transitions, 2506 flow [2022-12-06 05:28:03,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 170 transitions, 2506 flow [2022-12-06 05:28:03,296 INFO L130 PetriNetUnfolder]: 159/588 cut-off events. [2022-12-06 05:28:03,296 INFO L131 PetriNetUnfolder]: For 2790/2821 co-relation queries the response was YES. [2022-12-06 05:28:03,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 588 events. 159/588 cut-off events. For 2790/2821 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4465 event pairs, 22 based on Foata normal form. 9/572 useless extension candidates. Maximal degree in co-relation 2664. Up to 194 conditions per place. [2022-12-06 05:28:03,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 170 transitions, 2506 flow [2022-12-06 05:28:03,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 05:28:03,305 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:03,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 05:28:03,306 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 170 transitions, 2506 flow [2022-12-06 05:28:03,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:03,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:03,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:03,315 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-06 05:28:03,512 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,SelfDestructingSolverStorable15 [2022-12-06 05:28:03,512 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-06 05:28:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1639567539, now seen corresponding path program 2 times [2022-12-06 05:28:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:03,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282375106] [2022-12-06 05:28:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:03,571 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-06 05:28:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282375106] [2022-12-06 05:28:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282375106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:03,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:03,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:28:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098891010] [2022-12-06 05:28:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:03,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:28:03,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:03,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 170 transitions, 2506 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:03,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:03,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:03,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:03,982 INFO L130 PetriNetUnfolder]: 909/1746 cut-off events. [2022-12-06 05:28:03,982 INFO L131 PetriNetUnfolder]: For 12349/12349 co-relation queries the response was YES. [2022-12-06 05:28:03,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9839 conditions, 1746 events. 909/1746 cut-off events. For 12349/12349 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10805 event pairs, 148 based on Foata normal form. 16/1759 useless extension candidates. Maximal degree in co-relation 9357. Up to 628 conditions per place. [2022-12-06 05:28:03,997 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 158 selfloop transitions, 72 changer transitions 16/246 dead transitions. [2022-12-06 05:28:03,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 246 transitions, 3878 flow [2022-12-06 05:28:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:28:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:28:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 05:28:03,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32571428571428573 [2022-12-06 05:28:03,998 INFO L175 Difference]: Start difference. First operand has 91 places, 170 transitions, 2506 flow. Second operand 7 states and 57 transitions. [2022-12-06 05:28:03,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 246 transitions, 3878 flow [2022-12-06 05:28:04,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 246 transitions, 3704 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 05:28:04,050 INFO L231 Difference]: Finished difference. Result has 95 places, 185 transitions, 2676 flow [2022-12-06 05:28:04,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2676, PETRI_PLACES=95, PETRI_TRANSITIONS=185} [2022-12-06 05:28:04,051 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 73 predicate places. [2022-12-06 05:28:04,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:04,051 INFO L89 Accepts]: Start accepts. Operand has 95 places, 185 transitions, 2676 flow [2022-12-06 05:28:04,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:04,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:04,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 185 transitions, 2676 flow [2022-12-06 05:28:04,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 185 transitions, 2676 flow [2022-12-06 05:28:04,134 INFO L130 PetriNetUnfolder]: 180/671 cut-off events. [2022-12-06 05:28:04,135 INFO L131 PetriNetUnfolder]: For 3383/3388 co-relation queries the response was YES. [2022-12-06 05:28:04,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 671 events. 180/671 cut-off events. For 3383/3388 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5312 event pairs, 22 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 3093. Up to 214 conditions per place. [2022-12-06 05:28:04,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 185 transitions, 2676 flow [2022-12-06 05:28:04,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-06 05:28:04,146 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:04,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 05:28:04,147 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 185 transitions, 2676 flow [2022-12-06 05:28:04,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:04,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:04,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:28:04,148 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-06 05:28:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash 727892097, now seen corresponding path program 3 times [2022-12-06 05:28:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:04,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820190633] [2022-12-06 05:28:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:04,208 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-06 05:28:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:04,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820190633] [2022-12-06 05:28:04,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820190633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:04,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:28:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403409857] [2022-12-06 05:28:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:28:04,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:04,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 185 transitions, 2676 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:04,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:04,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:04,578 INFO L130 PetriNetUnfolder]: 850/1685 cut-off events. [2022-12-06 05:28:04,578 INFO L131 PetriNetUnfolder]: For 11978/11978 co-relation queries the response was YES. [2022-12-06 05:28:04,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9756 conditions, 1685 events. 850/1685 cut-off events. For 11978/11978 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10652 event pairs, 164 based on Foata normal form. 16/1698 useless extension candidates. Maximal degree in co-relation 9278. Up to 628 conditions per place. [2022-12-06 05:28:04,595 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 155 selfloop transitions, 83 changer transitions 3/241 dead transitions. [2022-12-06 05:28:04,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 241 transitions, 3716 flow [2022-12-06 05:28:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:28:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:28:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 05:28:04,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2022-12-06 05:28:04,596 INFO L175 Difference]: Start difference. First operand has 95 places, 185 transitions, 2676 flow. Second operand 7 states and 64 transitions. [2022-12-06 05:28:04,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 241 transitions, 3716 flow [2022-12-06 05:28:04,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 241 transitions, 3680 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 05:28:04,659 INFO L231 Difference]: Finished difference. Result has 102 places, 189 transitions, 2915 flow [2022-12-06 05:28:04,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2593, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2915, PETRI_PLACES=102, PETRI_TRANSITIONS=189} [2022-12-06 05:28:04,660 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 80 predicate places. [2022-12-06 05:28:04,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:04,660 INFO L89 Accepts]: Start accepts. Operand has 102 places, 189 transitions, 2915 flow [2022-12-06 05:28:04,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:04,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:04,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 189 transitions, 2915 flow [2022-12-06 05:28:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 189 transitions, 2915 flow [2022-12-06 05:28:04,753 INFO L130 PetriNetUnfolder]: 176/649 cut-off events. [2022-12-06 05:28:04,753 INFO L131 PetriNetUnfolder]: For 3929/3934 co-relation queries the response was YES. [2022-12-06 05:28:04,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3468 conditions, 649 events. 176/649 cut-off events. For 3929/3934 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5047 event pairs, 22 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 3311. Up to 200 conditions per place. [2022-12-06 05:28:04,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 189 transitions, 2915 flow [2022-12-06 05:28:04,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-06 05:28:04,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:04,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 05:28:04,767 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 189 transitions, 2915 flow [2022-12-06 05:28:04,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:04,767 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:04,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:28:04,767 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-06 05:28:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1779443366, now seen corresponding path program 1 times [2022-12-06 05:28:04,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:04,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694408723] [2022-12-06 05:28:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:04,848 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-06 05:28:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:04,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694408723] [2022-12-06 05:28:04,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694408723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:04,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276047506] [2022-12-06 05:28:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:04,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:04,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:04,852 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-06 05:28:04,875 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-06 05:28:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:04,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:28:04,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:04,994 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-06 05:28:04,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:28:04,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276047506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:04,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:28:04,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 05:28:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375193367] [2022-12-06 05:28:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:04,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:04,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:28:04,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:04,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 189 transitions, 2915 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:04,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:04,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:05,387 INFO L130 PetriNetUnfolder]: 878/1745 cut-off events. [2022-12-06 05:28:05,387 INFO L131 PetriNetUnfolder]: For 13044/13044 co-relation queries the response was YES. [2022-12-06 05:28:05,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 1745 events. 878/1745 cut-off events. For 13044/13044 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11073 event pairs, 393 based on Foata normal form. 12/1754 useless extension candidates. Maximal degree in co-relation 10324. Up to 1529 conditions per place. [2022-12-06 05:28:05,401 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 184 selfloop transitions, 30 changer transitions 3/217 dead transitions. [2022-12-06 05:28:05,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 217 transitions, 3644 flow [2022-12-06 05:28:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:28:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:28:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 05:28:05,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.384 [2022-12-06 05:28:05,403 INFO L175 Difference]: Start difference. First operand has 102 places, 189 transitions, 2915 flow. Second operand 5 states and 48 transitions. [2022-12-06 05:28:05,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 217 transitions, 3644 flow [2022-12-06 05:28:05,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 217 transitions, 3568 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:28:05,462 INFO L231 Difference]: Finished difference. Result has 106 places, 196 transitions, 3065 flow [2022-12-06 05:28:05,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3065, PETRI_PLACES=106, PETRI_TRANSITIONS=196} [2022-12-06 05:28:05,462 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 84 predicate places. [2022-12-06 05:28:05,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:05,462 INFO L89 Accepts]: Start accepts. Operand has 106 places, 196 transitions, 3065 flow [2022-12-06 05:28:05,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:05,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:05,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 196 transitions, 3065 flow [2022-12-06 05:28:05,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 196 transitions, 3065 flow [2022-12-06 05:28:05,537 INFO L130 PetriNetUnfolder]: 181/676 cut-off events. [2022-12-06 05:28:05,537 INFO L131 PetriNetUnfolder]: For 4098/4104 co-relation queries the response was YES. [2022-12-06 05:28:05,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 676 events. 181/676 cut-off events. For 4098/4104 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5333 event pairs, 22 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 3470. Up to 210 conditions per place. [2022-12-06 05:28:05,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 196 transitions, 3065 flow [2022-12-06 05:28:05,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 05:28:05,546 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:05,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:28:05,546 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 196 transitions, 3065 flow [2022-12-06 05:28:05,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:05,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:05,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:05,560 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-06 05:28:05,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:05,760 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-06 05:28:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 23906634, now seen corresponding path program 1 times [2022-12-06 05:28:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:05,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568846693] [2022-12-06 05:28:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:05,818 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-06 05:28:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568846693] [2022-12-06 05:28:05,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568846693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:05,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:05,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:28:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449651374] [2022-12-06 05:28:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:28:05,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:05,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 196 transitions, 3065 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:05,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:05,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:05,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:06,290 INFO L130 PetriNetUnfolder]: 1020/2013 cut-off events. [2022-12-06 05:28:06,292 INFO L131 PetriNetUnfolder]: For 16077/16077 co-relation queries the response was YES. [2022-12-06 05:28:06,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12448 conditions, 2013 events. 1020/2013 cut-off events. For 16077/16077 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13083 event pairs, 366 based on Foata normal form. 20/2030 useless extension candidates. Maximal degree in co-relation 11956. Up to 1434 conditions per place. [2022-12-06 05:28:06,309 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 184 selfloop transitions, 64 changer transitions 3/251 dead transitions. [2022-12-06 05:28:06,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 251 transitions, 4237 flow [2022-12-06 05:28:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:28:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:28:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 05:28:06,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.416 [2022-12-06 05:28:06,311 INFO L175 Difference]: Start difference. First operand has 106 places, 196 transitions, 3065 flow. Second operand 5 states and 52 transitions. [2022-12-06 05:28:06,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 251 transitions, 4237 flow [2022-12-06 05:28:06,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 251 transitions, 4172 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 05:28:06,379 INFO L231 Difference]: Finished difference. Result has 111 places, 216 transitions, 3597 flow [2022-12-06 05:28:06,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3597, PETRI_PLACES=111, PETRI_TRANSITIONS=216} [2022-12-06 05:28:06,379 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 89 predicate places. [2022-12-06 05:28:06,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:06,380 INFO L89 Accepts]: Start accepts. Operand has 111 places, 216 transitions, 3597 flow [2022-12-06 05:28:06,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:06,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:06,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 216 transitions, 3597 flow [2022-12-06 05:28:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 216 transitions, 3597 flow [2022-12-06 05:28:06,474 INFO L130 PetriNetUnfolder]: 203/763 cut-off events. [2022-12-06 05:28:06,474 INFO L131 PetriNetUnfolder]: For 5276/5286 co-relation queries the response was YES. [2022-12-06 05:28:06,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 763 events. 203/763 cut-off events. For 5276/5286 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6247 event pairs, 29 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 4091. Up to 253 conditions per place. [2022-12-06 05:28:06,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 216 transitions, 3597 flow [2022-12-06 05:28:06,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 716 [2022-12-06 05:28:06,483 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:06,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 05:28:06,483 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 216 transitions, 3597 flow [2022-12-06 05:28:06,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:06,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:06,484 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:06,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:28:06,484 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-06 05:28:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1456018078, now seen corresponding path program 2 times [2022-12-06 05:28:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:06,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480246167] [2022-12-06 05:28:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:06,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:06,549 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-06 05:28:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480246167] [2022-12-06 05:28:06,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480246167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445077721] [2022-12-06 05:28:06,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:28:06,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:06,551 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-06 05:28:06,554 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-06 05:28:06,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:28:06,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:28:06,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:28:06,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:06,710 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-06 05:28:06,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:06,731 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-06 05:28:06,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445077721] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:28:06,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:28:06,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:28:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533970815] [2022-12-06 05:28:06,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:28:06,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:28:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:06,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:28:06,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:28:06,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:28:06,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 216 transitions, 3597 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:06,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:06,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:28:06,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:07,381 INFO L130 PetriNetUnfolder]: 1244/2506 cut-off events. [2022-12-06 05:28:07,381 INFO L131 PetriNetUnfolder]: For 21500/21500 co-relation queries the response was YES. [2022-12-06 05:28:07,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15547 conditions, 2506 events. 1244/2506 cut-off events. For 21500/21500 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17529 event pairs, 236 based on Foata normal form. 32/2535 useless extension candidates. Maximal degree in co-relation 15019. Up to 1085 conditions per place. [2022-12-06 05:28:07,398 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 220 selfloop transitions, 93 changer transitions 9/322 dead transitions. [2022-12-06 05:28:07,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 322 transitions, 5338 flow [2022-12-06 05:28:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:28:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:28:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-12-06 05:28:07,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-06 05:28:07,400 INFO L175 Difference]: Start difference. First operand has 111 places, 216 transitions, 3597 flow. Second operand 11 states and 88 transitions. [2022-12-06 05:28:07,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 322 transitions, 5338 flow [2022-12-06 05:28:07,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 322 transitions, 5296 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-12-06 05:28:07,485 INFO L231 Difference]: Finished difference. Result has 128 places, 260 transitions, 4536 flow [2022-12-06 05:28:07,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3538, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4536, PETRI_PLACES=128, PETRI_TRANSITIONS=260} [2022-12-06 05:28:07,486 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 106 predicate places. [2022-12-06 05:28:07,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:07,486 INFO L89 Accepts]: Start accepts. Operand has 128 places, 260 transitions, 4536 flow [2022-12-06 05:28:07,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:07,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:07,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 260 transitions, 4536 flow [2022-12-06 05:28:07,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 260 transitions, 4536 flow [2022-12-06 05:28:07,620 INFO L130 PetriNetUnfolder]: 265/982 cut-off events. [2022-12-06 05:28:07,621 INFO L131 PetriNetUnfolder]: For 8891/8903 co-relation queries the response was YES. [2022-12-06 05:28:07,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5836 conditions, 982 events. 265/982 cut-off events. For 8891/8903 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8419 event pairs, 35 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 5655. Up to 330 conditions per place. [2022-12-06 05:28:07,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 260 transitions, 4536 flow [2022-12-06 05:28:07,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-06 05:28:07,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:28:07,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:28:08,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:28:08,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 05:28:08,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:08,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 924 [2022-12-06 05:28:08,410 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 260 transitions, 4584 flow [2022-12-06 05:28:08,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:08,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:08,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:08,419 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-06 05:28:08,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:08,611 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-06 05:28:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 345198502, now seen corresponding path program 2 times [2022-12-06 05:28:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:08,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250698603] [2022-12-06 05:28:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:08,667 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-06 05:28:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250698603] [2022-12-06 05:28:08,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250698603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:08,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:08,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:28:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002759384] [2022-12-06 05:28:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:08,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:28:08,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:28:08,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 260 transitions, 4584 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:08,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:08,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:28:08,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:09,115 INFO L130 PetriNetUnfolder]: 1193/2413 cut-off events. [2022-12-06 05:28:09,115 INFO L131 PetriNetUnfolder]: For 27383/27383 co-relation queries the response was YES. [2022-12-06 05:28:09,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16468 conditions, 2413 events. 1193/2413 cut-off events. For 27383/27383 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 16689 event pairs, 471 based on Foata normal form. 8/2418 useless extension candidates. Maximal degree in co-relation 15913. Up to 1899 conditions per place. [2022-12-06 05:28:09,132 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 233 selfloop transitions, 59 changer transitions 5/297 dead transitions. [2022-12-06 05:28:09,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 297 transitions, 5569 flow [2022-12-06 05:28:09,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:28:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:28:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 05:28:09,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3390804597701149 [2022-12-06 05:28:09,133 INFO L175 Difference]: Start difference. First operand has 128 places, 260 transitions, 4584 flow. Second operand 6 states and 59 transitions. [2022-12-06 05:28:09,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 297 transitions, 5569 flow [2022-12-06 05:28:09,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 297 transitions, 5300 flow, removed 87 selfloop flow, removed 2 redundant places. [2022-12-06 05:28:09,292 INFO L231 Difference]: Finished difference. Result has 134 places, 265 transitions, 4592 flow [2022-12-06 05:28:09,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4592, PETRI_PLACES=134, PETRI_TRANSITIONS=265} [2022-12-06 05:28:09,292 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 112 predicate places. [2022-12-06 05:28:09,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:09,293 INFO L89 Accepts]: Start accepts. Operand has 134 places, 265 transitions, 4592 flow [2022-12-06 05:28:09,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:09,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:09,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 265 transitions, 4592 flow [2022-12-06 05:28:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 265 transitions, 4592 flow [2022-12-06 05:28:09,426 INFO L130 PetriNetUnfolder]: 260/954 cut-off events. [2022-12-06 05:28:09,426 INFO L131 PetriNetUnfolder]: For 8952/8964 co-relation queries the response was YES. [2022-12-06 05:28:09,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 954 events. 260/954 cut-off events. For 8952/8964 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8123 event pairs, 40 based on Foata normal form. 1/930 useless extension candidates. Maximal degree in co-relation 5562. Up to 327 conditions per place. [2022-12-06 05:28:09,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 265 transitions, 4592 flow [2022-12-06 05:28:09,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-06 05:28:09,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:09,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 05:28:09,435 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 265 transitions, 4592 flow [2022-12-06 05:28:09,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:09,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:09,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:28:09,435 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-06 05:28:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 736231452, now seen corresponding path program 1 times [2022-12-06 05:28:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:09,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987231157] [2022-12-06 05:28:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:09,502 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-06 05:28:09,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:09,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987231157] [2022-12-06 05:28:09,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987231157] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:09,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522412240] [2022-12-06 05:28:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:09,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:09,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:09,508 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-06 05:28:09,509 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-06 05:28:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:09,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:28:09,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:09,691 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-06 05:28:09,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:09,721 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-06 05:28:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522412240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:28:09,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:28:09,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:28:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736048610] [2022-12-06 05:28:09,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:28:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:28:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:28:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:28:09,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:28:09,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 265 transitions, 4592 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:09,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:09,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:28:09,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:10,200 INFO L130 PetriNetUnfolder]: 1227/2477 cut-off events. [2022-12-06 05:28:10,200 INFO L131 PetriNetUnfolder]: For 29897/29897 co-relation queries the response was YES. [2022-12-06 05:28:10,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17180 conditions, 2477 events. 1227/2477 cut-off events. For 29897/29897 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17154 event pairs, 603 based on Foata normal form. 42/2516 useless extension candidates. Maximal degree in co-relation 16519. Up to 2337 conditions per place. [2022-12-06 05:28:10,218 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 266 selfloop transitions, 29 changer transitions 2/297 dead transitions. [2022-12-06 05:28:10,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 297 transitions, 5597 flow [2022-12-06 05:28:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:28:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:28:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 05:28:10,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3045977011494253 [2022-12-06 05:28:10,219 INFO L175 Difference]: Start difference. First operand has 134 places, 265 transitions, 4592 flow. Second operand 6 states and 53 transitions. [2022-12-06 05:28:10,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 297 transitions, 5597 flow [2022-12-06 05:28:10,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 297 transitions, 5362 flow, removed 41 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:10,370 INFO L231 Difference]: Finished difference. Result has 138 places, 274 transitions, 4647 flow [2022-12-06 05:28:10,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4357, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4647, PETRI_PLACES=138, PETRI_TRANSITIONS=274} [2022-12-06 05:28:10,371 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 116 predicate places. [2022-12-06 05:28:10,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:10,371 INFO L89 Accepts]: Start accepts. Operand has 138 places, 274 transitions, 4647 flow [2022-12-06 05:28:10,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:10,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:10,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 274 transitions, 4647 flow [2022-12-06 05:28:10,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 274 transitions, 4647 flow [2022-12-06 05:28:10,481 INFO L130 PetriNetUnfolder]: 270/987 cut-off events. [2022-12-06 05:28:10,481 INFO L131 PetriNetUnfolder]: For 10083/10107 co-relation queries the response was YES. [2022-12-06 05:28:10,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6019 conditions, 987 events. 270/987 cut-off events. For 10083/10107 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8455 event pairs, 41 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 5762. Up to 336 conditions per place. [2022-12-06 05:28:10,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 274 transitions, 4647 flow [2022-12-06 05:28:10,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 05:28:10,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L47-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [598] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_127| v_~f_inv~0.base_78) (+ (* v_~counter~0_160 4) v_~f_inv~0.offset_78)))) (and (not (= (ite |v_thread2_#t~short11#1_91| 1 0) 0)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (< .cse0 v_~n~0_56) (not (= (ite (and (<= 0 v_~counter~0_160) (< v_~counter~0_160 v_~n_inv~0_42)) 1 0) 0)) (= v_~counter~0_159 .cse0) (<= 0 .cse0) (< |v_thread2Thread1of1ForFork1_~i~1#1_24| v_~N~0_19) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (ite (= v_~counter~0_160 (select (select |v_#memory_int_127| v_~f~0.base_74) (+ (* .cse0 4) v_~f~0.offset_74))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) |v_thread2_#t~short11#1_92| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)))) InVars {~counter~0=v_~counter~0_160, ~f_inv~0.offset=v_~f_inv~0.offset_78, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~n~0=v_~n~0_56, ~f~0.offset=v_~f~0.offset_74, ~n_inv~0=v_~n_inv~0_42} OutVars{~counter~0=v_~counter~0_159, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_15|, ~f_inv~0.offset=v_~f_inv~0.offset_78, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_15|, ~f~0.base=v_~f~0.base_74, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~f~0.offset=v_~f~0.offset_74, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_15|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_15|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_19|, ~n~0=v_~n~0_56, ~n_inv~0=v_~n_inv~0_42} AuxVars[|v_thread2_#t~short11#1_91|, |v_thread2_#t~short11#1_92|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 05:28:10,693 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L47-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [598] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_127| v_~f_inv~0.base_78) (+ (* v_~counter~0_160 4) v_~f_inv~0.offset_78)))) (and (not (= (ite |v_thread2_#t~short11#1_91| 1 0) 0)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (< .cse0 v_~n~0_56) (not (= (ite (and (<= 0 v_~counter~0_160) (< v_~counter~0_160 v_~n_inv~0_42)) 1 0) 0)) (= v_~counter~0_159 .cse0) (<= 0 .cse0) (< |v_thread2Thread1of1ForFork1_~i~1#1_24| v_~N~0_19) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (ite (= v_~counter~0_160 (select (select |v_#memory_int_127| v_~f~0.base_74) (+ (* .cse0 4) v_~f~0.offset_74))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) |v_thread2_#t~short11#1_92| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)))) InVars {~counter~0=v_~counter~0_160, ~f_inv~0.offset=v_~f_inv~0.offset_78, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~n~0=v_~n~0_56, ~f~0.offset=v_~f~0.offset_74, ~n_inv~0=v_~n_inv~0_42} OutVars{~counter~0=v_~counter~0_159, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_15|, ~f_inv~0.offset=v_~f_inv~0.offset_78, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_15|, ~f~0.base=v_~f~0.base_74, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~f~0.offset=v_~f~0.offset_74, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_15|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_15|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_19|, ~n~0=v_~n~0_56, ~n_inv~0=v_~n_inv~0_42} AuxVars[|v_thread2_#t~short11#1_91|, |v_thread2_#t~short11#1_92|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 05:28:10,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L47-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [598] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_127| v_~f_inv~0.base_78) (+ (* v_~counter~0_160 4) v_~f_inv~0.offset_78)))) (and (not (= (ite |v_thread2_#t~short11#1_91| 1 0) 0)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (< .cse0 v_~n~0_56) (not (= (ite (and (<= 0 v_~counter~0_160) (< v_~counter~0_160 v_~n_inv~0_42)) 1 0) 0)) (= v_~counter~0_159 .cse0) (<= 0 .cse0) (< |v_thread2Thread1of1ForFork1_~i~1#1_24| v_~N~0_19) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (ite (= v_~counter~0_160 (select (select |v_#memory_int_127| v_~f~0.base_74) (+ (* .cse0 4) v_~f~0.offset_74))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) |v_thread2_#t~short11#1_92| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)))) InVars {~counter~0=v_~counter~0_160, ~f_inv~0.offset=v_~f_inv~0.offset_78, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~n~0=v_~n~0_56, ~f~0.offset=v_~f~0.offset_74, ~n_inv~0=v_~n_inv~0_42} OutVars{~counter~0=v_~counter~0_159, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_15|, ~f_inv~0.offset=v_~f_inv~0.offset_78, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_15|, ~f~0.base=v_~f~0.base_74, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~f~0.offset=v_~f~0.offset_74, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_15|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_15|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_19|, ~n~0=v_~n~0_56, ~n_inv~0=v_~n_inv~0_42} AuxVars[|v_thread2_#t~short11#1_91|, |v_thread2_#t~short11#1_92|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 05:28:11,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:11,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 655 [2022-12-06 05:28:11,026 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 273 transitions, 4665 flow [2022-12-06 05:28:11,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:11,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:11,027 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:11,039 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-06 05:28:11,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 05:28:11,233 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-06 05:28:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1326498288, now seen corresponding path program 3 times [2022-12-06 05:28:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:11,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310420910] [2022-12-06 05:28:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:11,304 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-06 05:28:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310420910] [2022-12-06 05:28:11,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310420910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140692515] [2022-12-06 05:28:11,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:28:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:11,306 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-06 05:28:11,331 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-06 05:28:11,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:28:11,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:28:11,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:28:11,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:11,476 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-06 05:28:11,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:28:11,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140692515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:11,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:28:11,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 05:28:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934285411] [2022-12-06 05:28:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:11,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:28:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:28:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:28:11,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:28:11,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 273 transitions, 4665 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:11,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:11,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:28:11,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:12,002 INFO L130 PetriNetUnfolder]: 1188/2398 cut-off events. [2022-12-06 05:28:12,003 INFO L131 PetriNetUnfolder]: For 29113/29113 co-relation queries the response was YES. [2022-12-06 05:28:12,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16700 conditions, 2398 events. 1188/2398 cut-off events. For 29113/29113 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16487 event pairs, 576 based on Foata normal form. 8/2403 useless extension candidates. Maximal degree in co-relation 16026. Up to 2257 conditions per place. [2022-12-06 05:28:12,015 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 253 selfloop transitions, 18 changer transitions 15/286 dead transitions. [2022-12-06 05:28:12,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 286 transitions, 5351 flow [2022-12-06 05:28:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:28:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:28:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 05:28:12,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:28:12,017 INFO L175 Difference]: Start difference. First operand has 137 places, 273 transitions, 4665 flow. Second operand 5 states and 48 transitions. [2022-12-06 05:28:12,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 286 transitions, 5351 flow [2022-12-06 05:28:12,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 286 transitions, 5200 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:12,129 INFO L231 Difference]: Finished difference. Result has 140 places, 267 transitions, 4469 flow [2022-12-06 05:28:12,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4516, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4469, PETRI_PLACES=140, PETRI_TRANSITIONS=267} [2022-12-06 05:28:12,129 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 118 predicate places. [2022-12-06 05:28:12,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:12,129 INFO L89 Accepts]: Start accepts. Operand has 140 places, 267 transitions, 4469 flow [2022-12-06 05:28:12,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:12,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:12,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 267 transitions, 4469 flow [2022-12-06 05:28:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 267 transitions, 4469 flow [2022-12-06 05:28:12,227 INFO L130 PetriNetUnfolder]: 266/927 cut-off events. [2022-12-06 05:28:12,228 INFO L131 PetriNetUnfolder]: For 9165/9189 co-relation queries the response was YES. [2022-12-06 05:28:12,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 927 events. 266/927 cut-off events. For 9165/9189 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7589 event pairs, 38 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 5438. Up to 306 conditions per place. [2022-12-06 05:28:12,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 267 transitions, 4469 flow [2022-12-06 05:28:12,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 800 [2022-12-06 05:28:12,235 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:12,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 05:28:12,236 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 267 transitions, 4469 flow [2022-12-06 05:28:12,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:12,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:12,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:12,245 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-06 05:28:12,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:12,438 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-06 05:28:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -169792398, now seen corresponding path program 1 times [2022-12-06 05:28:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:12,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107658846] [2022-12-06 05:28:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107658846] [2022-12-06 05:28:12,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107658846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930897555] [2022-12-06 05:28:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:12,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:12,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:12,728 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-06 05:28:12,756 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-06 05:28:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:12,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:28:12,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:12,887 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 05:28:12,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 84 [2022-12-06 05:28:12,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 05:28:12,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-12-06 05:28:12,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 19 [2022-12-06 05:28:12,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-06 05:28:12,928 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:28:12,929 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2022-12-06 05:28:12,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 05:28:12,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:28:12,994 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:28:12,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-12-06 05:28:13,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-06 05:28:13,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:28:13,118 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 05:28:13,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 19 [2022-12-06 05:28:13,131 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-06 05:28:13,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:15,539 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-06 05:28:15,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930897555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:28:15,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:28:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-12-06 05:28:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192073583] [2022-12-06 05:28:15,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:28:15,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:28:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:28:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=177, Unknown=4, NotChecked=0, Total=240 [2022-12-06 05:28:15,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:28:15,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 267 transitions, 4469 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:15,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:15,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:28:15,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:17,909 INFO L130 PetriNetUnfolder]: 1566/3117 cut-off events. [2022-12-06 05:28:17,909 INFO L131 PetriNetUnfolder]: For 37032/37032 co-relation queries the response was YES. [2022-12-06 05:28:17,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21620 conditions, 3117 events. 1566/3117 cut-off events. For 37032/37032 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 22360 event pairs, 370 based on Foata normal form. 8/3122 useless extension candidates. Maximal degree in co-relation 20572. Up to 1291 conditions per place. [2022-12-06 05:28:17,927 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 198 selfloop transitions, 81 changer transitions 186/465 dead transitions. [2022-12-06 05:28:17,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 465 transitions, 7971 flow [2022-12-06 05:28:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:28:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:28:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2022-12-06 05:28:17,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31919642857142855 [2022-12-06 05:28:17,929 INFO L175 Difference]: Start difference. First operand has 138 places, 267 transitions, 4469 flow. Second operand 14 states and 143 transitions. [2022-12-06 05:28:17,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 465 transitions, 7971 flow [2022-12-06 05:28:18,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 465 transitions, 7869 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 05:28:18,087 INFO L231 Difference]: Finished difference. Result has 151 places, 232 transitions, 4012 flow [2022-12-06 05:28:18,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4400, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4012, PETRI_PLACES=151, PETRI_TRANSITIONS=232} [2022-12-06 05:28:18,088 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 129 predicate places. [2022-12-06 05:28:18,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:18,088 INFO L89 Accepts]: Start accepts. Operand has 151 places, 232 transitions, 4012 flow [2022-12-06 05:28:18,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:18,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:18,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 232 transitions, 4012 flow [2022-12-06 05:28:18,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 232 transitions, 4012 flow [2022-12-06 05:28:18,175 INFO L130 PetriNetUnfolder]: 209/756 cut-off events. [2022-12-06 05:28:18,175 INFO L131 PetriNetUnfolder]: For 7895/7918 co-relation queries the response was YES. [2022-12-06 05:28:18,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 756 events. 209/756 cut-off events. For 7895/7918 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5939 event pairs, 36 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 4583. Up to 253 conditions per place. [2022-12-06 05:28:18,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 232 transitions, 4012 flow [2022-12-06 05:28:18,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 05:28:21,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:21,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3245 [2022-12-06 05:28:21,333 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 232 transitions, 4028 flow [2022-12-06 05:28:21,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:21,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:21,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:21,339 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-06 05:28:21,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:21,540 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-06 05:28:21,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1287169788, now seen corresponding path program 2 times [2022-12-06 05:28:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:21,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121156051] [2022-12-06 05:28:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:28:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121156051] [2022-12-06 05:28:21,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121156051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563207455] [2022-12-06 05:28:21,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:28:21,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:21,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:21,606 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-06 05:28:21,633 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-06 05:28:21,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:28:21,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:28:21,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:28:21,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:28:21,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:28:21,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563207455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:28:21,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:28:21,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:28:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245629179] [2022-12-06 05:28:21,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:28:21,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:28:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:28:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:28:21,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:28:21,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 232 transitions, 4028 flow. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:21,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:21,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:28:21,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:22,239 INFO L130 PetriNetUnfolder]: 919/1865 cut-off events. [2022-12-06 05:28:22,239 INFO L131 PetriNetUnfolder]: For 23640/23640 co-relation queries the response was YES. [2022-12-06 05:28:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 1865 events. 919/1865 cut-off events. For 23640/23640 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12079 event pairs, 185 based on Foata normal form. 36/1898 useless extension candidates. Maximal degree in co-relation 12760. Up to 1179 conditions per place. [2022-12-06 05:28:22,250 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 179 selfloop transitions, 98 changer transitions 1/278 dead transitions. [2022-12-06 05:28:22,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 278 transitions, 5031 flow [2022-12-06 05:28:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:28:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:28:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-12-06 05:28:22,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2867383512544803 [2022-12-06 05:28:22,252 INFO L175 Difference]: Start difference. First operand has 141 places, 232 transitions, 4028 flow. Second operand 9 states and 80 transitions. [2022-12-06 05:28:22,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 278 transitions, 5031 flow [2022-12-06 05:28:22,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 278 transitions, 4744 flow, removed 89 selfloop flow, removed 13 redundant places. [2022-12-06 05:28:22,347 INFO L231 Difference]: Finished difference. Result has 139 places, 233 transitions, 4013 flow [2022-12-06 05:28:22,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4013, PETRI_PLACES=139, PETRI_TRANSITIONS=233} [2022-12-06 05:28:22,348 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 117 predicate places. [2022-12-06 05:28:22,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:22,348 INFO L89 Accepts]: Start accepts. Operand has 139 places, 233 transitions, 4013 flow [2022-12-06 05:28:22,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:22,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:22,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 233 transitions, 4013 flow [2022-12-06 05:28:22,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 233 transitions, 4013 flow [2022-12-06 05:28:22,426 INFO L130 PetriNetUnfolder]: 206/752 cut-off events. [2022-12-06 05:28:22,426 INFO L131 PetriNetUnfolder]: For 7916/7940 co-relation queries the response was YES. [2022-12-06 05:28:22,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 752 events. 206/752 cut-off events. For 7916/7940 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5923 event pairs, 34 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 4369. Up to 250 conditions per place. [2022-12-06 05:28:22,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 233 transitions, 4013 flow [2022-12-06 05:28:22,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-06 05:28:22,445 WARN L322 ript$VariableManager]: TermVariable LBE310 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,445 WARN L322 ript$VariableManager]: TermVariable LBE122 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,445 WARN L322 ript$VariableManager]: TermVariable LBE97 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,446 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,446 WARN L322 ript$VariableManager]: TermVariable LBE350 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,446 WARN L322 ript$VariableManager]: TermVariable LBE329 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,446 WARN L322 ript$VariableManager]: TermVariable LBE107 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,446 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:22,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:28:22,652 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,SelfDestructingSolverStorable25 [2022-12-06 05:28:22,653 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2_#t~short11#1_186 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:28:22,656 INFO L158 Benchmark]: Toolchain (without parser) took 42802.19ms. Allocated memory was 165.7MB in the beginning and 606.1MB in the end (delta: 440.4MB). Free memory was 142.4MB in the beginning and 292.1MB in the end (delta: -149.7MB). Peak memory consumption was 292.2MB. Max. memory is 8.0GB. [2022-12-06 05:28:22,656 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 104.7MB in the beginning and 104.6MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:28:22,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.34ms. Allocated memory is still 165.7MB. Free memory was 141.9MB in the beginning and 129.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:28:22,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.57ms. Allocated memory is still 165.7MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:28:22,657 INFO L158 Benchmark]: Boogie Preprocessor took 39.75ms. Allocated memory is still 165.7MB. Free memory was 127.9MB in the beginning and 126.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:28:22,657 INFO L158 Benchmark]: RCFGBuilder took 714.28ms. Allocated memory is still 165.7MB. Free memory was 125.8MB in the beginning and 134.3MB in the end (delta: -8.5MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-12-06 05:28:22,658 INFO L158 Benchmark]: TraceAbstraction took 41702.89ms. Allocated memory was 165.7MB in the beginning and 606.1MB in the end (delta: 440.4MB). Free memory was 133.8MB in the beginning and 292.1MB in the end (delta: -158.3MB). Peak memory consumption was 283.7MB. Max. memory is 8.0GB. [2022-12-06 05:28:22,660 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 104.7MB in the beginning and 104.6MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.34ms. Allocated memory is still 165.7MB. Free memory was 141.9MB in the beginning and 129.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.57ms. Allocated memory is still 165.7MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.75ms. Allocated memory is still 165.7MB. Free memory was 127.9MB in the beginning and 126.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.28ms. Allocated memory is still 165.7MB. Free memory was 125.8MB in the beginning and 134.3MB in the end (delta: -8.5MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. * TraceAbstraction took 41702.89ms. Allocated memory was 165.7MB in the beginning and 606.1MB in the end (delta: 440.4MB). Free memory was 133.8MB in the beginning and 292.1MB in the end (delta: -158.3MB). Peak memory consumption was 283.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 134 PlacesBefore, 22 PlacesAfterwards, 140 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 93 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 257, unknown conditional: 0, unknown unconditional: 257] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 391, Positive conditional cache size: 0, Positive unconditional cache size: 391, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 72 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, 26 PlacesBefore, 25 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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, 27 PlacesBefore, 26 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 3, Positive unconditional cache size: 10, 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: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 76 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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.8s, 32 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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, 29 PlacesBefore, 29 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 70 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): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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, 30 PlacesBefore, 29 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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, 29 PlacesBefore, 28 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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: 2.7s, 34 PlacesBefore, 34 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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, 44 PlacesBefore, 44 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, 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: 2.9s, 58 PlacesBefore, 58 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 65 PlacesBefore, 65 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 492 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 73 PlacesBefore, 73 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 656 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 81 PlacesBefore, 81 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 582 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 85 PlacesBefore, 85 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 612 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 91 PlacesBefore, 91 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 644 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 95 PlacesBefore, 95 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 620 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 102 PlacesBefore, 102 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 620 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 106 PlacesBefore, 106 PlacesAfterwards, 196 TransitionsBefore, 196 TransitionsAfterwards, 638 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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, 111 PlacesBefore, 111 PlacesAfterwards, 216 TransitionsBefore, 216 TransitionsAfterwards, 716 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): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, 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.8s, 128 PlacesBefore, 128 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 12, independent: 9, independent conditional: 9, 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): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, 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, 134 PlacesBefore, 134 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 814 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): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, 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, 138 PlacesBefore, 137 PlacesAfterwards, 274 TransitionsBefore, 273 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 21, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, 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, 138 PlacesBefore, 138 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 800 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): 21, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, 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: 3.2s, 141 PlacesBefore, 141 PlacesAfterwards, 232 TransitionsBefore, 232 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, 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 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2_#t~short11#1_186 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2_#t~short11#1_186 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:28:22,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...