/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-figure3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:44:38,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:44:38,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:44:38,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:44:38,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:44:38,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:44:38,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:44:38,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:44:38,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:44:39,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:44:39,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:44:39,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:44:39,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:44:39,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:44:39,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:44:39,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:44:39,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:44:39,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:44:39,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:44:39,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:44:39,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:44:39,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:44:39,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:44:39,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:44:39,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:44:39,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:44:39,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:44:39,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:44:39,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:44:39,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:44:39,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:44:39,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:44:39,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:44:39,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:44:39,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:44:39,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:44:39,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:44:39,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:44:39,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:44:39,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:44:39,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:44:39,058 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-13 10:44:39,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:44:39,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:44:39,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:44:39,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:44:39,096 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:44:39,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:44:39,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:44:39,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:44:39,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:44:39,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:44:39,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:44:39,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:44:39,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:44:39,099 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:44:39,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:44:39,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:44:39,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:44:39,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:44:39,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:44:39,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:44:39,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:44:39,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:44:39,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:44:39,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:44:39,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:44:39,100 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:44:39,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:44:39,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:44:39,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:44:39,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 10:44:39,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:44:39,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:44:39,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:44:39,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:44:39,462 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:44:39,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-13 10:44:40,510 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:44:40,713 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:44:40,714 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-13 10:44:40,721 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe1e734f/acfab2fb4b574f5da638fca514edcb2a/FLAG7ba342c36 [2022-12-13 10:44:40,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe1e734f/acfab2fb4b574f5da638fca514edcb2a [2022-12-13 10:44:40,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:44:40,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:44:40,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:44:40,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:44:40,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:44:40,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:40,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cec8122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40, skipping insertion in model container [2022-12-13 10:44:40,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:40,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:44:40,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:44:40,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:44:40,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:44:40,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:44:40,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:44:40,921 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-figure3.wvr.c[2121,2134] [2022-12-13 10:44:40,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:44:40,936 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:44:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:44:40,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:44:40,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:44:40,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:44:40,966 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-figure3.wvr.c[2121,2134] [2022-12-13 10:44:40,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:44:40,985 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:44:40,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40 WrapperNode [2022-12-13 10:44:40,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:44:40,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:44:40,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:44:40,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:44:40,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,023 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2022-12-13 10:44:41,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:44:41,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:44:41,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:44:41,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:44:41,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,057 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:44:41,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:44:41,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:44:41,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:44:41,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (1/1) ... [2022-12-13 10:44:41,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:44:41,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:41,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:44:41,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:44:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:44:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:44:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:44:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:44:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:44:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:44:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:44:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:44:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:44:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:44:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:44:41,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:44:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:44:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:44:41,136 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:44:41,237 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:44:41,239 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:44:41,402 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:44:41,454 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:44:41,454 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 10:44:41,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:44:41 BoogieIcfgContainer [2022-12-13 10:44:41,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:44:41,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:44:41,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:44:41,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:44:41,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:44:40" (1/3) ... [2022-12-13 10:44:41,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2606f852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:44:41, skipping insertion in model container [2022-12-13 10:44:41,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:44:40" (2/3) ... [2022-12-13 10:44:41,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2606f852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:44:41, skipping insertion in model container [2022-12-13 10:44:41,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:44:41" (3/3) ... [2022-12-13 10:44:41,463 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure3.wvr.c [2022-12-13 10:44:41,481 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:44:41,481 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:44:41,481 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:44:41,574 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 10:44:41,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 10:44:41,670 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-13 10:44:41,670 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:44:41,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-13 10:44:41,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 10:44:41,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-13 10:44:41,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:41,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 10:44:41,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-13 10:44:41,748 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-13 10:44:41,748 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:44:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-13 10:44:41,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 10:44:41,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 10:44:43,860 INFO L241 LiptonReduction]: Total number of compositions: 55 [2022-12-13 10:44:43,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:44:43,878 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;@575034cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:44:43,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 10:44:43,883 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 10:44:43,883 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:44:43,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:43,884 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:43,884 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-13 10:44:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1374975466, now seen corresponding path program 1 times [2022-12-13 10:44:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:43,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560282401] [2022-12-13 10:44:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:44,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560282401] [2022-12-13 10:44:44,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560282401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:44,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:44,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 10:44:44,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189435726] [2022-12-13 10:44:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:44,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:44:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:44,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:44:44,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:44:44,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 10:44:44,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 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-13 10:44:44,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:44,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 10:44:44,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:44,415 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-13 10:44:44,415 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 10:44:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-13 10:44:44,419 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-13 10:44:44,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-13 10:44:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:44:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:44:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 10:44:44,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 10:44:44,431 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-13 10:44:44,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 113 flow [2022-12-13 10:44:44,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 10:44:44,437 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 48 flow [2022-12-13 10:44:44,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-13 10:44:44,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-13 10:44:44,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:44,444 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 10:44:44,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:44,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:44,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 10:44:44,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 10:44:44,463 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 10:44:44,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:44:44,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 7 conditions per place. [2022-12-13 10:44:44,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 10:44:44,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 10:44:44,466 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:44,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 10:44:44,469 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 48 flow [2022-12-13 10:44:44,469 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-13 10:44:44,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:44,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:44,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:44:44,470 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-13 10:44:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash -867956374, now seen corresponding path program 1 times [2022-12-13 10:44:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829557647] [2022-12-13 10:44:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:44,652 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-13 10:44:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829557647] [2022-12-13 10:44:44,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829557647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:44,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:44,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:44:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950259366] [2022-12-13 10:44:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:44,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:44:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:44:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:44:44,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 10:44:44,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 48 flow. Second operand has 5 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-13 10:44:44,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:44,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 10:44:44,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:44,771 INFO L130 PetriNetUnfolder]: 72/149 cut-off events. [2022-12-13 10:44:44,771 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 10:44:44,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 149 events. 72/149 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 467 event pairs, 24 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 177. Up to 78 conditions per place. [2022-12-13 10:44:44,773 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-13 10:44:44,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 178 flow [2022-12-13 10:44:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:44:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:44:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 10:44:44,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 10:44:44,776 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 48 flow. Second operand 5 states and 37 transitions. [2022-12-13 10:44:44,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 178 flow [2022-12-13 10:44:44,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:44:44,779 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 74 flow [2022-12-13 10:44:44,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-13 10:44:44,780 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-13 10:44:44,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:44,780 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 74 flow [2022-12-13 10:44:44,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:44,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:44,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 74 flow [2022-12-13 10:44:44,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 74 flow [2022-12-13 10:44:44,786 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-13 10:44:44,787 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:44:44,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 27 events. 3/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 34. Up to 8 conditions per place. [2022-12-13 10:44:44,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 74 flow [2022-12-13 10:44:44,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 10:44:44,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:44,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 10:44:44,943 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 71 flow [2022-12-13 10:44:44,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-13 10:44:44,943 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:44,943 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:44,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:44:44,943 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-13 10:44:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash 883944601, now seen corresponding path program 1 times [2022-12-13 10:44:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:44,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965606491] [2022-12-13 10:44:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:45,017 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-13 10:44:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:45,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965606491] [2022-12-13 10:44:45,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965606491] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:45,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438388283] [2022-12-13 10:44:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:45,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:45,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:45,023 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-13 10:44:45,033 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-13 10:44:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:45,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:44:45,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:45,183 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-13 10:44:45,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:45,239 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-13 10:44:45,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438388283] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:45,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 10:44:45,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-13 10:44:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775207833] [2022-12-13 10:44:45,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:45,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:44:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:45,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:44:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:44:45,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-13 10:44:45,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-13 10:44:45,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:45,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-13 10:44:45,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:45,304 INFO L130 PetriNetUnfolder]: 42/87 cut-off events. [2022-12-13 10:44:45,304 INFO L131 PetriNetUnfolder]: For 143/145 co-relation queries the response was YES. [2022-12-13 10:44:45,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 87 events. 42/87 cut-off events. For 143/145 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 214 event pairs, 18 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 96. Up to 56 conditions per place. [2022-12-13 10:44:45,305 INFO L137 encePairwiseOnDemand]: 14/16 looper letters, 17 selfloop transitions, 1 changer transitions 5/24 dead transitions. [2022-12-13 10:44:45,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 134 flow [2022-12-13 10:44:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:44:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:44:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 10:44:45,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 10:44:45,307 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 71 flow. Second operand 3 states and 27 transitions. [2022-12-13 10:44:45,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 134 flow [2022-12-13 10:44:45,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 119 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:44:45,309 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 54 flow [2022-12-13 10:44:45,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2022-12-13 10:44:45,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-13 10:44:45,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:45,310 INFO L89 Accepts]: Start accepts. Operand has 22 places, 16 transitions, 54 flow [2022-12-13 10:44:45,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:45,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:45,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 16 transitions, 54 flow [2022-12-13 10:44:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 54 flow [2022-12-13 10:44:45,313 INFO L130 PetriNetUnfolder]: 3/20 cut-off events. [2022-12-13 10:44:45,314 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:44:45,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 3/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 7 conditions per place. [2022-12-13 10:44:45,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 54 flow [2022-12-13 10:44:45,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 10:44:45,315 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:45,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 10:44:45,316 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 54 flow [2022-12-13 10:44:45,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-13 10:44:45,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:45,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:45,326 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-13 10:44:45,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:45,522 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-13 10:44:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash -745912205, now seen corresponding path program 1 times [2022-12-13 10:44:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:45,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136282054] [2022-12-13 10:44:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:45,720 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-13 10:44:45,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136282054] [2022-12-13 10:44:45,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136282054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421082682] [2022-12-13 10:44:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:45,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:45,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:45,722 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-13 10:44:45,749 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-13 10:44:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:45,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:44:45,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:45,821 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-13 10:44:45,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:45,871 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-13 10:44:45,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421082682] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:45,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:45,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 10:44:45,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678037640] [2022-12-13 10:44:45,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:45,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:44:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:45,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:44:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:44:45,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 10:44:45,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:45,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:45,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 10:44:45,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:45,980 INFO L130 PetriNetUnfolder]: 73/146 cut-off events. [2022-12-13 10:44:45,981 INFO L131 PetriNetUnfolder]: For 53/55 co-relation queries the response was YES. [2022-12-13 10:44:45,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 146 events. 73/146 cut-off events. For 53/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 429 event pairs, 19 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 179. Up to 61 conditions per place. [2022-12-13 10:44:45,982 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 26 selfloop transitions, 6 changer transitions 4/37 dead transitions. [2022-12-13 10:44:45,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 37 transitions, 184 flow [2022-12-13 10:44:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:44:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:44:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 10:44:45,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2022-12-13 10:44:45,983 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 54 flow. Second operand 4 states and 41 transitions. [2022-12-13 10:44:45,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 37 transitions, 184 flow [2022-12-13 10:44:45,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 175 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:44:45,985 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 95 flow [2022-12-13 10:44:45,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2022-12-13 10:44:45,985 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-13 10:44:45,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:45,986 INFO L89 Accepts]: Start accepts. Operand has 24 places, 20 transitions, 95 flow [2022-12-13 10:44:45,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:45,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:45,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 20 transitions, 95 flow [2022-12-13 10:44:45,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 95 flow [2022-12-13 10:44:45,991 INFO L130 PetriNetUnfolder]: 5/35 cut-off events. [2022-12-13 10:44:45,991 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:44:45,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 35 events. 5/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2022-12-13 10:44:45,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 20 transitions, 95 flow [2022-12-13 10:44:45,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 10:44:45,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:45,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 10:44:45,993 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 95 flow [2022-12-13 10:44:45,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:45,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:45,993 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:46,027 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-13 10:44:46,212 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,SelfDestructingSolverStorable3 [2022-12-13 10:44:46,213 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-13 10:44:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1954653069, now seen corresponding path program 2 times [2022-12-13 10:44:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:46,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683772984] [2022-12-13 10:44:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:46,315 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-13 10:44:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:46,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683772984] [2022-12-13 10:44:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683772984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:46,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:46,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:44:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774245882] [2022-12-13 10:44:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:44:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:44:46,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:44:46,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 10:44:46,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 95 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-13 10:44:46,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:46,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 10:44:46,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:46,431 INFO L130 PetriNetUnfolder]: 112/229 cut-off events. [2022-12-13 10:44:46,431 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-13 10:44:46,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 229 events. 112/229 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 819 event pairs, 7 based on Foata normal form. 6/235 useless extension candidates. Maximal degree in co-relation 323. Up to 81 conditions per place. [2022-12-13 10:44:46,434 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 35 selfloop transitions, 10 changer transitions 9/54 dead transitions. [2022-12-13 10:44:46,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 54 transitions, 340 flow [2022-12-13 10:44:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:44:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:44:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 10:44:46,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 10:44:46,437 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 95 flow. Second operand 7 states and 45 transitions. [2022-12-13 10:44:46,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 54 transitions, 340 flow [2022-12-13 10:44:46,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 54 transitions, 324 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 10:44:46,440 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 171 flow [2022-12-13 10:44:46,440 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-13 10:44:46,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-13 10:44:46,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:46,443 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 171 flow [2022-12-13 10:44:46,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:46,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:46,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 171 flow [2022-12-13 10:44:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 171 flow [2022-12-13 10:44:46,455 INFO L130 PetriNetUnfolder]: 12/66 cut-off events. [2022-12-13 10:44:46,455 INFO L131 PetriNetUnfolder]: For 41/42 co-relation queries the response was YES. [2022-12-13 10:44:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 66 events. 12/66 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 233 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 150. Up to 16 conditions per place. [2022-12-13 10:44:46,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 27 transitions, 171 flow [2022-12-13 10:44:46,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 10:44:46,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:46,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 10:44:46,482 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 160 flow [2022-12-13 10:44:46,486 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-13 10:44:46,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:46,486 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:46,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:44:46,488 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-13 10:44:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1515525847, now seen corresponding path program 3 times [2022-12-13 10:44:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:46,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622501615] [2022-12-13 10:44:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:46,642 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-13 10:44:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622501615] [2022-12-13 10:44:46,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622501615] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349185492] [2022-12-13 10:44:46,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 10:44:46,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:46,645 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-13 10:44:46,656 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-13 10:44:46,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 10:44:46,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:44:46,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:44:46,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:46,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:46,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349185492] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:46,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:46,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2022-12-13 10:44:46,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179661708] [2022-12-13 10:44:46,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:46,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:44:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:46,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:44:46,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:44:46,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 10:44:46,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 160 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:46,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:46,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 10:44:46,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:47,096 INFO L130 PetriNetUnfolder]: 143/303 cut-off events. [2022-12-13 10:44:47,096 INFO L131 PetriNetUnfolder]: For 437/437 co-relation queries the response was YES. [2022-12-13 10:44:47,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 303 events. 143/303 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1227 event pairs, 16 based on Foata normal form. 12/315 useless extension candidates. Maximal degree in co-relation 529. Up to 139 conditions per place. [2022-12-13 10:44:47,099 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 47 selfloop transitions, 12 changer transitions 16/75 dead transitions. [2022-12-13 10:44:47,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 75 transitions, 542 flow [2022-12-13 10:44:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:44:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:44:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 10:44:47,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-13 10:44:47,100 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 160 flow. Second operand 8 states and 58 transitions. [2022-12-13 10:44:47,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 75 transitions, 542 flow [2022-12-13 10:44:47,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 75 transitions, 533 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 10:44:47,103 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 278 flow [2022-12-13 10:44:47,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=278, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-13 10:44:47,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-13 10:44:47,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:47,104 INFO L89 Accepts]: Start accepts. Operand has 40 places, 34 transitions, 278 flow [2022-12-13 10:44:47,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:47,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:47,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 278 flow [2022-12-13 10:44:47,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 278 flow [2022-12-13 10:44:47,114 INFO L130 PetriNetUnfolder]: 15/99 cut-off events. [2022-12-13 10:44:47,115 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-13 10:44:47,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 99 events. 15/99 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 467 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 269. Up to 23 conditions per place. [2022-12-13 10:44:47,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 278 flow [2022-12-13 10:44:47,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 10:44:47,131 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:47,131 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:47,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:47,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [298] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_108 v_~counter~0_110) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_49|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_30| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_30|) (= v_thread1Thread1of1ForFork0_~i~0_37 (+ v_thread1Thread1of1ForFork0_~i~0_38 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_30| 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_38 4294967296) (mod v_~N~0_55 4294967296)) (= (ite (< 0 (mod v_~counter~0_110 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_30|)) InVars {~counter~0=v_~counter~0_110, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_38, ~N~0=v_~N~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_30|, ~counter~0=v_~counter~0_108, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_37, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_38|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_30|, ~N~0=v_~N~0_55, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:47,401 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:47,402 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:47,607 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:44:47,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 504 [2022-12-13 10:44:47,608 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 296 flow [2022-12-13 10:44:47,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:47,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:47,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:47,616 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-13 10:44:47,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:47,809 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-13 10:44:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2110934487, now seen corresponding path program 1 times [2022-12-13 10:44:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:47,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924304602] [2022-12-13 10:44:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:47,885 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-13 10:44:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:47,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924304602] [2022-12-13 10:44:47,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924304602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:47,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:47,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:44:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063595466] [2022-12-13 10:44:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:47,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:44:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:44:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:44:47,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 10:44:47,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 296 flow. Second operand has 5 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-13 10:44:47,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:47,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 10:44:47,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:47,970 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-13 10:44:47,971 INFO L131 PetriNetUnfolder]: For 995/995 co-relation queries the response was YES. [2022-12-13 10:44:47,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 260 events. 120/260 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1001 event pairs, 62 based on Foata normal form. 12/272 useless extension candidates. Maximal degree in co-relation 594. Up to 206 conditions per place. [2022-12-13 10:44:47,972 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 30 selfloop transitions, 5 changer transitions 15/50 dead transitions. [2022-12-13 10:44:47,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 461 flow [2022-12-13 10:44:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:44:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:44:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 10:44:47,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 10:44:47,974 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 296 flow. Second operand 5 states and 39 transitions. [2022-12-13 10:44:47,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 461 flow [2022-12-13 10:44:47,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 440 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 10:44:47,978 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 257 flow [2022-12-13 10:44:47,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 10:44:47,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-13 10:44:47,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:47,979 INFO L89 Accepts]: Start accepts. Operand has 42 places, 29 transitions, 257 flow [2022-12-13 10:44:47,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:47,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:47,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 257 flow [2022-12-13 10:44:47,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 257 flow [2022-12-13 10:44:47,986 INFO L130 PetriNetUnfolder]: 12/62 cut-off events. [2022-12-13 10:44:47,986 INFO L131 PetriNetUnfolder]: For 152/170 co-relation queries the response was YES. [2022-12-13 10:44:47,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 62 events. 12/62 cut-off events. For 152/170 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 198 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 185. Up to 19 conditions per place. [2022-12-13 10:44:47,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 257 flow [2022-12-13 10:44:47,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 10:44:47,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L41-4: Formula: (and (< 0 (mod v_~N~0_61 4294967296)) (= v_~counter~0_126 (+ v_~c~0_74 v_~counter~0_127)) (= v_thread1Thread1of1ForFork0_~i~0_51 1)) InVars {~counter~0=v_~counter~0_127, ~c~0=v_~c~0_74, ~N~0=v_~N~0_61} OutVars{~counter~0=v_~counter~0_126, ~c~0=v_~c~0_74, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_51, ~N~0=v_~N~0_61} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:48,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:48,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (= v_~counter~0_136 v_~counter~0_134) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|) (< 0 (mod v_~N~0_65 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_59 1) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_55|) (= (ite (< 0 (mod (+ v_~c~0_78 v_~counter~0_134) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|)) InVars {~counter~0=v_~counter~0_136, ~c~0=v_~c~0_78, ~N~0=v_~N~0_65} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36|, ~counter~0=v_~counter~0_134, ~c~0=v_~c~0_78, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_42|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_59, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_44|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_55|, ~N~0=v_~N~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:48,241 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (= v_~counter~0_136 v_~counter~0_134) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|) (< 0 (mod v_~N~0_65 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_59 1) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_55|) (= (ite (< 0 (mod (+ v_~c~0_78 v_~counter~0_134) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|)) InVars {~counter~0=v_~counter~0_136, ~c~0=v_~c~0_78, ~N~0=v_~N~0_65} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36|, ~counter~0=v_~counter~0_134, ~c~0=v_~c~0_78, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_42|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_59, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_44|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_55|, ~N~0=v_~N~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [305] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_67 4294967296))) (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_58|) |v_thread2Thread1of1ForFork1_~i~1#1_57|) (= (ite (< 0 (mod (+ v_~c~0_80 v_~counter~0_142) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|) (= (+ v_thread1Thread1of1ForFork0_~i~0_62 1) v_thread1Thread1of1ForFork0_~i~0_61) (= v_~counter~0_142 v_~counter~0_140) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_58| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_62 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|))) InVars {~counter~0=v_~counter~0_142, ~c~0=v_~c~0_80, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_62, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_58|, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_38|, ~counter~0=v_~counter~0_140, ~c~0=v_~c~0_80, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_44|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_61, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_46|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_38|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_57|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:48,241 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:48,241 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:48,357 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:44:48,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 379 [2022-12-13 10:44:48,358 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 265 flow [2022-12-13 10:44:48,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-13 10:44:48,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:48,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:48,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:44:48,359 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-13 10:44:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1465679036, now seen corresponding path program 1 times [2022-12-13 10:44:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:48,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664685101] [2022-12-13 10:44:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:48,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664685101] [2022-12-13 10:44:48,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664685101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:48,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:48,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:44:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296690432] [2022-12-13 10:44:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:48,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:44:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:48,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:44:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:44:48,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:44:48,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 265 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:48,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:48,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:44:48,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:48,616 INFO L130 PetriNetUnfolder]: 96/196 cut-off events. [2022-12-13 10:44:48,616 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2022-12-13 10:44:48,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 196 events. 96/196 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 695 event pairs, 29 based on Foata normal form. 7/201 useless extension candidates. Maximal degree in co-relation 539. Up to 131 conditions per place. [2022-12-13 10:44:48,618 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 27 selfloop transitions, 8 changer transitions 8/43 dead transitions. [2022-12-13 10:44:48,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 407 flow [2022-12-13 10:44:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:44:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:44:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 10:44:48,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 10:44:48,620 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 265 flow. Second operand 4 states and 38 transitions. [2022-12-13 10:44:48,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 407 flow [2022-12-13 10:44:48,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 335 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-13 10:44:48,623 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 225 flow [2022-12-13 10:44:48,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2022-12-13 10:44:48,625 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-13 10:44:48,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:48,626 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 225 flow [2022-12-13 10:44:48,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:48,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:48,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 225 flow [2022-12-13 10:44:48,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 225 flow [2022-12-13 10:44:48,632 INFO L130 PetriNetUnfolder]: 11/55 cut-off events. [2022-12-13 10:44:48,633 INFO L131 PetriNetUnfolder]: For 110/111 co-relation queries the response was YES. [2022-12-13 10:44:48,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 55 events. 11/55 cut-off events. For 110/111 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 178 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 149. Up to 15 conditions per place. [2022-12-13 10:44:48,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 225 flow [2022-12-13 10:44:48,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 10:44:48,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] $Ultimate##0-->L41-4: Formula: (and (= 2 v_thread1Thread1of1ForFork0_~i~0_55) (= (+ v_~counter~0_131 (* v_~c~0_76 2)) v_~counter~0_130) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_55) 4294967296) (mod v_~N~0_63 4294967296))) InVars {~counter~0=v_~counter~0_131, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [297] $Ultimate##0-->L51-4: Formula: (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (= (ite (< 0 (mod (+ v_~counter~0_104 (* v_~c~0_66 4294967295)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| 0)) (= v_~counter~0_104 (+ v_~counter~0_102 (* v_~c~0_66 2))) (not (= (ite (< 0 (mod v_~counter~0_104 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_45|) 4294967296) (mod v_~N~0_53 4294967296))) InVars {~counter~0=v_~counter~0_104, ~c~0=v_~c~0_66, ~N~0=v_~N~0_53} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26|, ~counter~0=v_~counter~0_102, ~c~0=v_~c~0_66, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_34|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_45|, ~N~0=v_~N~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:48,810 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] $Ultimate##0-->L41-4: Formula: (and (= 2 v_thread1Thread1of1ForFork0_~i~0_55) (= (+ v_~counter~0_131 (* v_~c~0_76 2)) v_~counter~0_130) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_55) 4294967296) (mod v_~N~0_63 4294967296))) InVars {~counter~0=v_~counter~0_131, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [301] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_59 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_51|) (< (mod v_thread1Thread1of1ForFork0_~i~0_48 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_32| 0)) (= (ite (< 0 (mod v_~counter~0_122 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_32|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_32| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_32|) (= v_thread1Thread1of1ForFork0_~i~0_47 (+ v_thread1Thread1of1ForFork0_~i~0_48 1)) (= v_~counter~0_122 (+ v_~c~0_72 v_~counter~0_120)) (< 1 .cse0))) InVars {~counter~0=v_~counter~0_122, ~c~0=v_~c~0_72, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_48, ~N~0=v_~N~0_59} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_32|, ~counter~0=v_~counter~0_120, ~c~0=v_~c~0_72, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_36|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_47, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_32|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:48,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:48,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-13 10:44:48,926 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 234 flow [2022-12-13 10:44:48,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:48,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:48,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:48,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:44:48,926 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-13 10:44:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash -887951269, now seen corresponding path program 1 times [2022-12-13 10:44:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:48,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502974866] [2022-12-13 10:44:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:48,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502974866] [2022-12-13 10:44:48,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502974866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:48,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:48,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:44:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133401690] [2022-12-13 10:44:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:48,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:44:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:48,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:44:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:44:48,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:44:48,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:48,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:48,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:44:48,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:49,017 INFO L130 PetriNetUnfolder]: 103/207 cut-off events. [2022-12-13 10:44:49,018 INFO L131 PetriNetUnfolder]: For 588/588 co-relation queries the response was YES. [2022-12-13 10:44:49,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 207 events. 103/207 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 735 event pairs, 63 based on Foata normal form. 6/207 useless extension candidates. Maximal degree in co-relation 716. Up to 198 conditions per place. [2022-12-13 10:44:49,019 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 31 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2022-12-13 10:44:49,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 339 flow [2022-12-13 10:44:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:44:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:44:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 10:44:49,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 10:44:49,020 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 234 flow. Second operand 3 states and 27 transitions. [2022-12-13 10:44:49,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 339 flow [2022-12-13 10:44:49,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 315 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:44:49,023 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 223 flow [2022-12-13 10:44:49,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 10:44:49,023 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-13 10:44:49,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:49,024 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 223 flow [2022-12-13 10:44:49,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:49,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:49,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 223 flow [2022-12-13 10:44:49,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 223 flow [2022-12-13 10:44:49,030 INFO L130 PetriNetUnfolder]: 13/60 cut-off events. [2022-12-13 10:44:49,030 INFO L131 PetriNetUnfolder]: For 80/82 co-relation queries the response was YES. [2022-12-13 10:44:49,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 60 events. 13/60 cut-off events. For 80/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 205 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 166. Up to 19 conditions per place. [2022-12-13 10:44:49,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 223 flow [2022-12-13 10:44:49,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:44:49,031 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:49,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 10:44:49,032 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 223 flow [2022-12-13 10:44:49,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:49,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:49,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:49,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:44:49,033 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-13 10:44:49,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 671149750, now seen corresponding path program 1 times [2022-12-13 10:44:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:49,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81919994] [2022-12-13 10:44:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:49,092 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-13 10:44:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81919994] [2022-12-13 10:44:49,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81919994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26699510] [2022-12-13 10:44:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:49,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:49,095 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-13 10:44:49,121 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-13 10:44:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:49,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:44:49,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:49,178 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-13 10:44:49,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:49,204 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-13 10:44:49,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26699510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:49,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:49,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-13 10:44:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239442965] [2022-12-13 10:44:49,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:49,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:44:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:44:49,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:44:49,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:44:49,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:49,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:49,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:44:49,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:49,318 INFO L130 PetriNetUnfolder]: 117/239 cut-off events. [2022-12-13 10:44:49,318 INFO L131 PetriNetUnfolder]: For 818/818 co-relation queries the response was YES. [2022-12-13 10:44:49,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 239 events. 117/239 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 912 event pairs, 41 based on Foata normal form. 12/251 useless extension candidates. Maximal degree in co-relation 788. Up to 136 conditions per place. [2022-12-13 10:44:49,320 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 10 changer transitions 4/46 dead transitions. [2022-12-13 10:44:49,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 408 flow [2022-12-13 10:44:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:44:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:44:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 10:44:49,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 10:44:49,321 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 223 flow. Second operand 5 states and 38 transitions. [2022-12-13 10:44:49,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 408 flow [2022-12-13 10:44:49,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 396 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 10:44:49,325 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 265 flow [2022-12-13 10:44:49,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-13 10:44:49,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-13 10:44:49,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:49,326 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 265 flow [2022-12-13 10:44:49,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:49,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:49,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 265 flow [2022-12-13 10:44:49,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 265 flow [2022-12-13 10:44:49,335 INFO L130 PetriNetUnfolder]: 16/77 cut-off events. [2022-12-13 10:44:49,335 INFO L131 PetriNetUnfolder]: For 162/164 co-relation queries the response was YES. [2022-12-13 10:44:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 77 events. 16/77 cut-off events. For 162/164 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 298 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 216. Up to 22 conditions per place. [2022-12-13 10:44:49,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 265 flow [2022-12-13 10:44:49,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 10:44:49,337 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:49,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 10:44:49,338 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 265 flow [2022-12-13 10:44:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:49,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:49,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:49,347 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-13 10:44:49,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:49,544 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-13 10:44:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 595573816, now seen corresponding path program 1 times [2022-12-13 10:44:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554889645] [2022-12-13 10:44:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:49,713 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-13 10:44:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554889645] [2022-12-13 10:44:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554889645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14133736] [2022-12-13 10:44:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:49,716 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-13 10:44:49,726 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-13 10:44:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:49,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:44:49,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:49,814 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-13 10:44:49,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:49,846 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-13 10:44:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14133736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:49,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:49,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 10:44:49,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662890275] [2022-12-13 10:44:49,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:44:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:44:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:44:49,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:44:49,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 265 flow. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:49,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:49,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:44:49,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:49,949 INFO L130 PetriNetUnfolder]: 161/330 cut-off events. [2022-12-13 10:44:49,949 INFO L131 PetriNetUnfolder]: For 1529/1529 co-relation queries the response was YES. [2022-12-13 10:44:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 330 events. 161/330 cut-off events. For 1529/1529 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1396 event pairs, 36 based on Foata normal form. 7/337 useless extension candidates. Maximal degree in co-relation 862. Up to 121 conditions per place. [2022-12-13 10:44:49,952 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 30 selfloop transitions, 16 changer transitions 4/50 dead transitions. [2022-12-13 10:44:49,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 484 flow [2022-12-13 10:44:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:44:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:44:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 10:44:49,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-13 10:44:49,953 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 265 flow. Second operand 4 states and 39 transitions. [2022-12-13 10:44:49,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 484 flow [2022-12-13 10:44:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 450 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 10:44:49,957 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 366 flow [2022-12-13 10:44:49,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 10:44:49,958 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 10:44:49,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:49,958 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 366 flow [2022-12-13 10:44:49,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:49,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:49,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 366 flow [2022-12-13 10:44:49,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 366 flow [2022-12-13 10:44:49,969 INFO L130 PetriNetUnfolder]: 21/109 cut-off events. [2022-12-13 10:44:49,969 INFO L131 PetriNetUnfolder]: For 265/267 co-relation queries the response was YES. [2022-12-13 10:44:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 109 events. 21/109 cut-off events. For 265/267 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 516 event pairs, 1 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 334. Up to 31 conditions per place. [2022-12-13 10:44:49,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 366 flow [2022-12-13 10:44:49,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 10:44:49,972 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:49,972 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:50,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:50,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 10:44:50,127 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 376 flow [2022-12-13 10:44:50,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:50,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:50,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:50,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 10:44:50,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 10:44:50,328 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-13 10:44:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash 435733038, now seen corresponding path program 1 times [2022-12-13 10:44:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:50,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482201510] [2022-12-13 10:44:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:50,409 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-13 10:44:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:50,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482201510] [2022-12-13 10:44:50,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482201510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:50,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:50,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:44:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182591199] [2022-12-13 10:44:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:44:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:44:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:44:50,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:44:50,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:50,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:50,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:44:50,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:50,503 INFO L130 PetriNetUnfolder]: 147/292 cut-off events. [2022-12-13 10:44:50,503 INFO L131 PetriNetUnfolder]: For 1580/1580 co-relation queries the response was YES. [2022-12-13 10:44:50,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 292 events. 147/292 cut-off events. For 1580/1580 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1201 event pairs, 66 based on Foata normal form. 4/294 useless extension candidates. Maximal degree in co-relation 928. Up to 248 conditions per place. [2022-12-13 10:44:50,506 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 30 selfloop transitions, 6 changer transitions 8/44 dead transitions. [2022-12-13 10:44:50,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 500 flow [2022-12-13 10:44:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:44:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:44:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 10:44:50,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-13 10:44:50,507 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 376 flow. Second operand 4 states and 31 transitions. [2022-12-13 10:44:50,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 500 flow [2022-12-13 10:44:50,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 468 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-12-13 10:44:50,511 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 366 flow [2022-12-13 10:44:50,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 10:44:50,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2022-12-13 10:44:50,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:50,512 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 366 flow [2022-12-13 10:44:50,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:50,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:50,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 366 flow [2022-12-13 10:44:50,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 366 flow [2022-12-13 10:44:50,522 INFO L130 PetriNetUnfolder]: 24/96 cut-off events. [2022-12-13 10:44:50,522 INFO L131 PetriNetUnfolder]: For 241/243 co-relation queries the response was YES. [2022-12-13 10:44:50,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 96 events. 24/96 cut-off events. For 241/243 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 394 event pairs, 6 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 325. Up to 28 conditions per place. [2022-12-13 10:44:50,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 366 flow [2022-12-13 10:44:50,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 10:44:50,524 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:50,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 10:44:50,525 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 366 flow [2022-12-13 10:44:50,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:50,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:50,525 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:50,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:44:50,525 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-13 10:44:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 673730871, now seen corresponding path program 1 times [2022-12-13 10:44:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:50,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85333465] [2022-12-13 10:44:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:50,595 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-13 10:44:50,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:50,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85333465] [2022-12-13 10:44:50,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85333465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:50,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111519688] [2022-12-13 10:44:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:50,597 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-13 10:44:50,599 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-13 10:44:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:50,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:44:50,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:50,680 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-13 10:44:50,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:50,708 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-13 10:44:50,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111519688] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:50,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:50,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 10:44:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765665063] [2022-12-13 10:44:50,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:50,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:44:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:44:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:44:50,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:44:50,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:50,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:50,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:44:50,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:50,870 INFO L130 PetriNetUnfolder]: 163/327 cut-off events. [2022-12-13 10:44:50,870 INFO L131 PetriNetUnfolder]: For 1776/1776 co-relation queries the response was YES. [2022-12-13 10:44:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 327 events. 163/327 cut-off events. For 1776/1776 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1363 event pairs, 55 based on Foata normal form. 12/339 useless extension candidates. Maximal degree in co-relation 1455. Up to 207 conditions per place. [2022-12-13 10:44:50,873 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 41 selfloop transitions, 15 changer transitions 4/60 dead transitions. [2022-12-13 10:44:50,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 647 flow [2022-12-13 10:44:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:44:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:44:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-13 10:44:50,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 10:44:50,874 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 366 flow. Second operand 6 states and 44 transitions. [2022-12-13 10:44:50,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 647 flow [2022-12-13 10:44:50,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 588 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-13 10:44:50,879 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 402 flow [2022-12-13 10:44:50,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-13 10:44:50,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2022-12-13 10:44:50,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:50,880 INFO L89 Accepts]: Start accepts. Operand has 49 places, 38 transitions, 402 flow [2022-12-13 10:44:50,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:50,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:50,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 38 transitions, 402 flow [2022-12-13 10:44:50,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 402 flow [2022-12-13 10:44:50,892 INFO L130 PetriNetUnfolder]: 28/124 cut-off events. [2022-12-13 10:44:50,892 INFO L131 PetriNetUnfolder]: For 364/366 co-relation queries the response was YES. [2022-12-13 10:44:50,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 124 events. 28/124 cut-off events. For 364/366 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 600 event pairs, 7 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 413. Up to 35 conditions per place. [2022-12-13 10:44:50,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 38 transitions, 402 flow [2022-12-13 10:44:50,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 10:44:50,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:50,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:50,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 10:44:50,961 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 414 flow [2022-12-13 10:44:50,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:50,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:50,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:50,969 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-13 10:44:51,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:51,162 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-13 10:44:51,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -241744211, now seen corresponding path program 2 times [2022-12-13 10:44:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:51,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987053352] [2022-12-13 10:44:51,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:51,238 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-13 10:44:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:51,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987053352] [2022-12-13 10:44:51,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987053352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:51,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:51,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:44:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271780586] [2022-12-13 10:44:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:44:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:44:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:44:51,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 10:44:51,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:51,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:51,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 10:44:51,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:51,353 INFO L130 PetriNetUnfolder]: 191/389 cut-off events. [2022-12-13 10:44:51,353 INFO L131 PetriNetUnfolder]: For 2267/2267 co-relation queries the response was YES. [2022-12-13 10:44:51,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 389 events. 191/389 cut-off events. For 2267/2267 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1749 event pairs, 65 based on Foata normal form. 8/397 useless extension candidates. Maximal degree in co-relation 1417. Up to 185 conditions per place. [2022-12-13 10:44:51,356 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 43 selfloop transitions, 15 changer transitions 3/61 dead transitions. [2022-12-13 10:44:51,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 755 flow [2022-12-13 10:44:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:44:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:44:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-13 10:44:51,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 10:44:51,358 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 414 flow. Second operand 4 states and 35 transitions. [2022-12-13 10:44:51,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 755 flow [2022-12-13 10:44:51,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 683 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-13 10:44:51,363 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 502 flow [2022-12-13 10:44:51,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 10:44:51,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 10:44:51,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:51,364 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 502 flow [2022-12-13 10:44:51,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:51,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:51,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 502 flow [2022-12-13 10:44:51,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 502 flow [2022-12-13 10:44:51,379 INFO L130 PetriNetUnfolder]: 39/148 cut-off events. [2022-12-13 10:44:51,379 INFO L131 PetriNetUnfolder]: For 708/712 co-relation queries the response was YES. [2022-12-13 10:44:51,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 148 events. 39/148 cut-off events. For 708/712 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 732 event pairs, 6 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 599. Up to 61 conditions per place. [2022-12-13 10:44:51,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 502 flow [2022-12-13 10:44:51,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 10:44:51,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|) (not (= (ite (< 0 (mod (+ v_~counter~0_182 (* v_~c~0_92 2)) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_87 3) (= v_~counter~0_184 v_~counter~0_182) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_75|) (< 2 (mod v_~N~0_79 4294967296)) (= (ite (< 0 (mod (+ v_~c~0_92 v_~counter~0_182) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|)) InVars {~counter~0=v_~counter~0_184, ~c~0=v_~c~0_92, ~N~0=v_~N~0_79} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54|, ~counter~0=v_~counter~0_182, ~c~0=v_~c~0_92, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_68|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_87, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_75|, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:51,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|) (not (= (ite (< 0 (mod (+ v_~counter~0_182 (* v_~c~0_92 2)) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_87 3) (= v_~counter~0_184 v_~counter~0_182) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_75|) (< 2 (mod v_~N~0_79 4294967296)) (= (ite (< 0 (mod (+ v_~c~0_92 v_~counter~0_182) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|)) InVars {~counter~0=v_~counter~0_184, ~c~0=v_~c~0_92, ~N~0=v_~N~0_79} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_54|, ~counter~0=v_~counter~0_182, ~c~0=v_~c~0_92, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_68|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_87, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_54|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_75|, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [314] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_81 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_81| 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_94 v_~counter~0_192) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= v_~counter~0_192 v_~counter~0_190) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_92 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_92 1) v_thread1Thread1of1ForFork0_~i~0_91) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_81|) |v_thread2Thread1of1ForFork1_~i~1#1_80|))) InVars {~counter~0=v_~counter~0_192, ~c~0=v_~c~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_92, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_81|, ~N~0=v_~N~0_81} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, ~counter~0=v_~counter~0_190, ~c~0=v_~c~0_94, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_72|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_91, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_80|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:51,501 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:51,501 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:51,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:51,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-13 10:44:51,681 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 522 flow [2022-12-13 10:44:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:51,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:51,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:44:51,682 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-13 10:44:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1885299659, now seen corresponding path program 1 times [2022-12-13 10:44:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495893512] [2022-12-13 10:44:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:51,781 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-13 10:44:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495893512] [2022-12-13 10:44:51,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495893512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001861644] [2022-12-13 10:44:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:51,784 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-13 10:44:51,835 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-13 10:44:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:51,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:44:51,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:51,965 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-13 10:44:51,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:52,060 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-13 10:44:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001861644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:52,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:52,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 10:44:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652103928] [2022-12-13 10:44:52,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:52,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:44:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:44:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:44:52,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:44:52,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 522 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:52,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:52,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:44:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:53,070 INFO L130 PetriNetUnfolder]: 431/906 cut-off events. [2022-12-13 10:44:53,071 INFO L131 PetriNetUnfolder]: For 6255/6255 co-relation queries the response was YES. [2022-12-13 10:44:53,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 906 events. 431/906 cut-off events. For 6255/6255 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5296 event pairs, 41 based on Foata normal form. 38/944 useless extension candidates. Maximal degree in co-relation 3678. Up to 391 conditions per place. [2022-12-13 10:44:53,078 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 144 selfloop transitions, 87 changer transitions 9/240 dead transitions. [2022-12-13 10:44:53,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 240 transitions, 2393 flow [2022-12-13 10:44:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 10:44:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 10:44:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 197 transitions. [2022-12-13 10:44:53,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30877742946708464 [2022-12-13 10:44:53,081 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 522 flow. Second operand 29 states and 197 transitions. [2022-12-13 10:44:53,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 240 transitions, 2393 flow [2022-12-13 10:44:53,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 240 transitions, 2299 flow, removed 38 selfloop flow, removed 1 redundant places. [2022-12-13 10:44:53,092 INFO L231 Difference]: Finished difference. Result has 86 places, 119 transitions, 1608 flow [2022-12-13 10:44:53,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1608, PETRI_PLACES=86, PETRI_TRANSITIONS=119} [2022-12-13 10:44:53,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 66 predicate places. [2022-12-13 10:44:53,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:53,093 INFO L89 Accepts]: Start accepts. Operand has 86 places, 119 transitions, 1608 flow [2022-12-13 10:44:53,095 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:53,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:53,095 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 119 transitions, 1608 flow [2022-12-13 10:44:53,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 119 transitions, 1608 flow [2022-12-13 10:44:53,132 INFO L130 PetriNetUnfolder]: 89/348 cut-off events. [2022-12-13 10:44:53,132 INFO L131 PetriNetUnfolder]: For 2803/2804 co-relation queries the response was YES. [2022-12-13 10:44:53,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 348 events. 89/348 cut-off events. For 2803/2804 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2404 event pairs, 7 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1690. Up to 138 conditions per place. [2022-12-13 10:44:53,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 119 transitions, 1608 flow [2022-12-13 10:44:53,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 10:44:53,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:53,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:53,369 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:53,369 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:53,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:53,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:53,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 10:44:53,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:53,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:53,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 10:44:54,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:54,112 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:54,113 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:54,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [323] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_95 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res.offset_24| 0) (= |v_thread2Thread1of1ForFork1_~i~1#1_108| (+ |v_thread2Thread1of1ForFork1_~i~1#1_109| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| 0)) (= (ite (< 0 (mod v_~counter~0_232 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (= |v_thread1Thread1of1ForFork0_#res.base_24| 0) (= v_~counter~0_232 (+ v_~counter~0_231 v_~c~0_108)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse0) (not (< (mod v_thread1Thread1of1ForFork0_~i~0_112 4294967296) .cse0)))) InVars {~counter~0=v_~counter~0_232, ~c~0=v_~c~0_108, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_112, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~N~0=v_~N~0_95} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, ~counter~0=v_~counter~0_231, ~c~0=v_~c~0_108, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_24|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_112, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_24|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~N~0=v_~N~0_95} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:54,211 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:54,212 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:54,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:54,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 10:44:54,633 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 10:44:54,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1540 [2022-12-13 10:44:54,633 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 112 transitions, 1657 flow [2022-12-13 10:44:54,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:54,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:54,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:54,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 10:44:54,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:54,840 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-13 10:44:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1005044101, now seen corresponding path program 1 times [2022-12-13 10:44:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:54,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231509520] [2022-12-13 10:44:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:54,942 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-13 10:44:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:54,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231509520] [2022-12-13 10:44:54,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231509520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656503284] [2022-12-13 10:44:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:54,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:54,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:54,944 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-13 10:44:54,947 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-13 10:44:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:55,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:44:55,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:55,034 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-13 10:44:55,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:55,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656503284] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:55,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:55,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-13 10:44:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957009460] [2022-12-13 10:44:55,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:55,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:44:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:44:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:44:55,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 10:44:55,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 112 transitions, 1657 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 10:44:55,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:55,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 10:44:55,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:55,327 INFO L130 PetriNetUnfolder]: 420/857 cut-off events. [2022-12-13 10:44:55,327 INFO L131 PetriNetUnfolder]: For 9265/9265 co-relation queries the response was YES. [2022-12-13 10:44:55,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 857 events. 420/857 cut-off events. For 9265/9265 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4864 event pairs, 159 based on Foata normal form. 12/859 useless extension candidates. Maximal degree in co-relation 4897. Up to 683 conditions per place. [2022-12-13 10:44:55,335 INFO L137 encePairwiseOnDemand]: 19/34 looper letters, 101 selfloop transitions, 39 changer transitions 7/147 dead transitions. [2022-12-13 10:44:55,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 2270 flow [2022-12-13 10:44:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:44:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:44:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 10:44:55,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29901960784313725 [2022-12-13 10:44:55,337 INFO L175 Difference]: Start difference. First operand has 78 places, 112 transitions, 1657 flow. Second operand 6 states and 61 transitions. [2022-12-13 10:44:55,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 2270 flow [2022-12-13 10:44:55,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 1479 flow, removed 392 selfloop flow, removed 7 redundant places. [2022-12-13 10:44:55,368 INFO L231 Difference]: Finished difference. Result has 79 places, 116 transitions, 1158 flow [2022-12-13 10:44:55,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1158, PETRI_PLACES=79, PETRI_TRANSITIONS=116} [2022-12-13 10:44:55,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 59 predicate places. [2022-12-13 10:44:55,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:55,369 INFO L89 Accepts]: Start accepts. Operand has 79 places, 116 transitions, 1158 flow [2022-12-13 10:44:55,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:55,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:55,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 116 transitions, 1158 flow [2022-12-13 10:44:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 116 transitions, 1158 flow [2022-12-13 10:44:55,398 INFO L130 PetriNetUnfolder]: 91/334 cut-off events. [2022-12-13 10:44:55,399 INFO L131 PetriNetUnfolder]: For 1584/1594 co-relation queries the response was YES. [2022-12-13 10:44:55,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 334 events. 91/334 cut-off events. For 1584/1594 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2233 event pairs, 10 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 1167. Up to 121 conditions per place. [2022-12-13 10:44:55,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 116 transitions, 1158 flow [2022-12-13 10:44:55,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-13 10:44:55,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:55,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod (+ v_~c~0_98 v_~counter~0_202) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (= v_thread1Thread1of1ForFork0_~i~0_99 4) (not (= (ite (< 0 (mod (+ v_~counter~0_202 (* v_~c~0_98 2)) 4294967296)) 1 0) 0)) (= 4 |v_thread2Thread1of1ForFork1_~i~1#1_86|) (< 3 (mod v_~N~0_85 4294967296)) (= v_~counter~0_202 v_~counter~0_204) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|)) InVars {~counter~0=v_~counter~0_204, ~c~0=v_~c~0_98, ~N~0=v_~N~0_85} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, ~counter~0=v_~counter~0_202, ~c~0=v_~c~0_98, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_78|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_99, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_71|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_86|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [338] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_121 4294967296))) (and (= (ite (< 0 (mod (+ v_~counter~0_283 v_~c~0_128) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (= v_~counter~0_285 v_~counter~0_283) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_152| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_150 (+ v_thread1Thread1of1ForFork0_~i~0_151 1)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_152| 1) |v_thread2Thread1of1ForFork1_~i~1#1_151|) (< (mod v_thread1Thread1of1ForFork0_~i~0_151 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0)))) InVars {~counter~0=v_~counter~0_285, ~c~0=v_~c~0_128, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_151, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_152|, ~N~0=v_~N~0_121} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, ~counter~0=v_~counter~0_283, ~c~0=v_~c~0_128, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_101|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_150, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_107|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_151|, ~N~0=v_~N~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:55,477 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:55,477 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:55,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod (+ v_~c~0_98 v_~counter~0_202) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (= v_thread1Thread1of1ForFork0_~i~0_99 4) (not (= (ite (< 0 (mod (+ v_~counter~0_202 (* v_~c~0_98 2)) 4294967296)) 1 0) 0)) (= 4 |v_thread2Thread1of1ForFork1_~i~1#1_86|) (< 3 (mod v_~N~0_85 4294967296)) (= v_~counter~0_202 v_~counter~0_204) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|)) InVars {~counter~0=v_~counter~0_204, ~c~0=v_~c~0_98, ~N~0=v_~N~0_85} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, ~counter~0=v_~counter~0_202, ~c~0=v_~c~0_98, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_78|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_99, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_71|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_86|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:55,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:55,830 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:44:55,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-13 10:44:55,831 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 115 transitions, 1169 flow [2022-12-13 10:44:55,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 10:44:55,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:55,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:55,840 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-13 10:44:56,032 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,SelfDestructingSolverStorable15 [2022-12-13 10:44:56,032 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-13 10:44:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1178495337, now seen corresponding path program 1 times [2022-12-13 10:44:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:56,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511808329] [2022-12-13 10:44:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511808329] [2022-12-13 10:44:56,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511808329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:44:56,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:44:56,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:44:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598513600] [2022-12-13 10:44:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:44:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:44:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:44:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:44:56,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 10:44:56,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 115 transitions, 1169 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:56,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:56,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 10:44:56,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:56,400 INFO L130 PetriNetUnfolder]: 447/940 cut-off events. [2022-12-13 10:44:56,400 INFO L131 PetriNetUnfolder]: For 6592/6592 co-relation queries the response was YES. [2022-12-13 10:44:56,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4724 conditions, 940 events. 447/940 cut-off events. For 6592/6592 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5342 event pairs, 116 based on Foata normal form. 37/975 useless extension candidates. Maximal degree in co-relation 4013. Up to 521 conditions per place. [2022-12-13 10:44:56,407 INFO L137 encePairwiseOnDemand]: 19/36 looper letters, 90 selfloop transitions, 47 changer transitions 10/147 dead transitions. [2022-12-13 10:44:56,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 147 transitions, 1653 flow [2022-12-13 10:44:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:44:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:44:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 10:44:56,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 10:44:56,408 INFO L175 Difference]: Start difference. First operand has 76 places, 115 transitions, 1169 flow. Second operand 5 states and 66 transitions. [2022-12-13 10:44:56,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 147 transitions, 1653 flow [2022-12-13 10:44:56,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 147 transitions, 1557 flow, removed 48 selfloop flow, removed 1 redundant places. [2022-12-13 10:44:56,425 INFO L231 Difference]: Finished difference. Result has 80 places, 120 transitions, 1291 flow [2022-12-13 10:44:56,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1291, PETRI_PLACES=80, PETRI_TRANSITIONS=120} [2022-12-13 10:44:56,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 60 predicate places. [2022-12-13 10:44:56,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:56,426 INFO L89 Accepts]: Start accepts. Operand has 80 places, 120 transitions, 1291 flow [2022-12-13 10:44:56,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:56,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:56,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 120 transitions, 1291 flow [2022-12-13 10:44:56,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 120 transitions, 1291 flow [2022-12-13 10:44:56,460 INFO L130 PetriNetUnfolder]: 98/371 cut-off events. [2022-12-13 10:44:56,460 INFO L131 PetriNetUnfolder]: For 1822/1832 co-relation queries the response was YES. [2022-12-13 10:44:56,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 371 events. 98/371 cut-off events. For 1822/1832 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2478 event pairs, 19 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 1367. Up to 138 conditions per place. [2022-12-13 10:44:56,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 120 transitions, 1291 flow [2022-12-13 10:44:56,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-13 10:44:56,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_73 3) (= v_~counter~0_158 (+ v_~counter~0_160 (* v_~c~0_86 3))) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_73) 4294967296) (mod v_~N~0_73 4294967296))) InVars {~counter~0=v_~counter~0_160, ~c~0=v_~c~0_86, ~N~0=v_~N~0_73} OutVars{~counter~0=v_~counter~0_158, ~c~0=v_~c~0_86, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_73, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [322] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78| 0)) (= v_~counter~0_225 v_~counter~0_227) (= (ite (< 0 (mod v_~counter~0_227 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (= |v_thread2Thread1of1ForFork1_~i~1#1_106| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (= v_thread1Thread1of1ForFork0_~i~0_108 (+ v_thread1Thread1of1ForFork0_~i~0_109 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_109 4294967296) (mod v_~N~0_93 4294967296))) InVars {~counter~0=v_~counter~0_227, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_109, ~N~0=v_~N~0_93} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78|, ~counter~0=v_~counter~0_225, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_83|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_108, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_86|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, ~N~0=v_~N~0_93, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_106|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:56,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_73 3) (= v_~counter~0_158 (+ v_~counter~0_160 (* v_~c~0_86 3))) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_73) 4294967296) (mod v_~N~0_73 4294967296))) InVars {~counter~0=v_~counter~0_160, ~c~0=v_~c~0_86, ~N~0=v_~N~0_73} OutVars{~counter~0=v_~counter~0_158, ~c~0=v_~c~0_86, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_73, ~N~0=v_~N~0_73} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [321] $Ultimate##0-->L51-4: Formula: (and (< 1 (mod v_~N~0_91 4294967296)) (= v_~counter~0_221 (+ v_~counter~0_219 (* 2 v_~c~0_104))) (not (= (ite (< 0 (mod v_~counter~0_221 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_74| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_102|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_74| 0)) (= (ite (< 0 (mod (+ v_~counter~0_219 v_~c~0_104) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|)) InVars {~counter~0=v_~counter~0_221, ~c~0=v_~c~0_104, ~N~0=v_~N~0_91} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_74|, ~counter~0=v_~counter~0_219, ~c~0=v_~c~0_104, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_82|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_102|, ~N~0=v_~N~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:56,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:56,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 10:44:56,717 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 120 transitions, 1319 flow [2022-12-13 10:44:56,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:56,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:56,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:56,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 10:44:56,717 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-13 10:44:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 967925065, now seen corresponding path program 1 times [2022-12-13 10:44:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:56,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526198334] [2022-12-13 10:44:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:56,770 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-13 10:44:56,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526198334] [2022-12-13 10:44:56,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526198334] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749271712] [2022-12-13 10:44:56,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:56,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:56,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:56,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:44:56,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 10:44:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:56,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:44:56,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:56,864 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-13 10:44:56,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:56,881 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-13 10:44:56,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749271712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:56,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:56,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:44:56,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556808074] [2022-12-13 10:44:56,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:56,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:44:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:56,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:44:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:44:56,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:44:56,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 120 transitions, 1319 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:56,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:56,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:44:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:57,079 INFO L130 PetriNetUnfolder]: 480/990 cut-off events. [2022-12-13 10:44:57,079 INFO L131 PetriNetUnfolder]: For 6207/6207 co-relation queries the response was YES. [2022-12-13 10:44:57,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 990 events. 480/990 cut-off events. For 6207/6207 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5689 event pairs, 213 based on Foata normal form. 10/992 useless extension candidates. Maximal degree in co-relation 4531. Up to 844 conditions per place. [2022-12-13 10:44:57,088 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 29 changer transitions 1/146 dead transitions. [2022-12-13 10:44:57,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 146 transitions, 1774 flow [2022-12-13 10:44:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:44:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:44:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-13 10:44:57,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3161290322580645 [2022-12-13 10:44:57,089 INFO L175 Difference]: Start difference. First operand has 80 places, 120 transitions, 1319 flow. Second operand 5 states and 49 transitions. [2022-12-13 10:44:57,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 146 transitions, 1774 flow [2022-12-13 10:44:57,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 146 transitions, 1739 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 10:44:57,110 INFO L231 Difference]: Finished difference. Result has 84 places, 124 transitions, 1414 flow [2022-12-13 10:44:57,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1414, PETRI_PLACES=84, PETRI_TRANSITIONS=124} [2022-12-13 10:44:57,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 64 predicate places. [2022-12-13 10:44:57,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:57,111 INFO L89 Accepts]: Start accepts. Operand has 84 places, 124 transitions, 1414 flow [2022-12-13 10:44:57,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:57,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:57,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 124 transitions, 1414 flow [2022-12-13 10:44:57,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 124 transitions, 1414 flow [2022-12-13 10:44:57,161 INFO L130 PetriNetUnfolder]: 108/394 cut-off events. [2022-12-13 10:44:57,161 INFO L131 PetriNetUnfolder]: For 2196/2197 co-relation queries the response was YES. [2022-12-13 10:44:57,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 394 events. 108/394 cut-off events. For 2196/2197 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2691 event pairs, 19 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1526. Up to 149 conditions per place. [2022-12-13 10:44:57,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 124 transitions, 1414 flow [2022-12-13 10:44:57,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-13 10:44:57,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] $Ultimate##0-->L41-4: Formula: (and (< 3 (mod v_~N~0_129 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= |v_thread2Thread1of1ForFork1_~i~1#1_163| 1) (= v_thread1Thread1of1ForFork0_~i~0_166 4) (= v_~counter~0_305 (+ v_~counter~0_307 (* 3 v_~c~0_136))) (= (ite (< 0 (mod v_~counter~0_305 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|)) InVars {~counter~0=v_~counter~0_307, ~c~0=v_~c~0_136, ~N~0=v_~N~0_129} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_305, ~c~0=v_~c~0_136, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_113|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_166, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, ~N~0=v_~N~0_129, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_163|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:44:57,178 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:57,178 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:57,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:44:57,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-13 10:44:57,372 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 124 transitions, 1442 flow [2022-12-13 10:44:57,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:57,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:57,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:57,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 10:44:57,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 10:44:57,578 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-13 10:44:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1332818218, now seen corresponding path program 1 times [2022-12-13 10:44:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993539697] [2022-12-13 10:44:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:57,653 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-13 10:44:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993539697] [2022-12-13 10:44:57,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993539697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992895184] [2022-12-13 10:44:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:57,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:57,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:57,656 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:44:57,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 10:44:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:57,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:44:57,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:57,756 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-13 10:44:57,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:57,781 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-13 10:44:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992895184] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:57,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:57,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 10:44:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278237664] [2022-12-13 10:44:57,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:57,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:44:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:44:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:44:57,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 10:44:57,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 124 transitions, 1442 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-13 10:44:57,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:57,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 10:44:57,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:58,046 INFO L130 PetriNetUnfolder]: 497/1029 cut-off events. [2022-12-13 10:44:58,047 INFO L131 PetriNetUnfolder]: For 8208/8208 co-relation queries the response was YES. [2022-12-13 10:44:58,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5541 conditions, 1029 events. 497/1029 cut-off events. For 8208/8208 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6066 event pairs, 197 based on Foata normal form. 12/1041 useless extension candidates. Maximal degree in co-relation 5087. Up to 793 conditions per place. [2022-12-13 10:44:58,056 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 112 selfloop transitions, 42 changer transitions 5/159 dead transitions. [2022-12-13 10:44:58,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 159 transitions, 1995 flow [2022-12-13 10:44:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:44:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:44:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-12-13 10:44:58,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-13 10:44:58,057 INFO L175 Difference]: Start difference. First operand has 83 places, 124 transitions, 1442 flow. Second operand 7 states and 63 transitions. [2022-12-13 10:44:58,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 159 transitions, 1995 flow [2022-12-13 10:44:58,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 159 transitions, 1931 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 10:44:58,080 INFO L231 Difference]: Finished difference. Result has 89 places, 126 transitions, 1545 flow [2022-12-13 10:44:58,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1545, PETRI_PLACES=89, PETRI_TRANSITIONS=126} [2022-12-13 10:44:58,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 69 predicate places. [2022-12-13 10:44:58,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:58,081 INFO L89 Accepts]: Start accepts. Operand has 89 places, 126 transitions, 1545 flow [2022-12-13 10:44:58,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:58,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:58,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 126 transitions, 1545 flow [2022-12-13 10:44:58,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 126 transitions, 1545 flow [2022-12-13 10:44:58,118 INFO L130 PetriNetUnfolder]: 112/418 cut-off events. [2022-12-13 10:44:58,118 INFO L131 PetriNetUnfolder]: For 2626/2627 co-relation queries the response was YES. [2022-12-13 10:44:58,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 418 events. 112/418 cut-off events. For 2626/2627 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2934 event pairs, 20 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1734. Up to 158 conditions per place. [2022-12-13 10:44:58,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 126 transitions, 1545 flow [2022-12-13 10:44:58,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-13 10:44:58,129 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:58,129 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:58,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] $Ultimate##0-->L51-4: Formula: (and (not (= (ite (< 0 (mod (+ (* 2 v_~c~0_130) v_~counter~0_291) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|) (= (ite (< 0 (mod (+ v_~counter~0_289 v_~c~0_130) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|) (< 4 (mod v_~N~0_123 4294967296)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_155|) (= 5 v_thread1Thread1of1ForFork0_~i~0_154) (= v_~counter~0_289 v_~counter~0_291) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0))) InVars {~counter~0=v_~counter~0_291, ~c~0=v_~c~0_130, ~N~0=v_~N~0_123} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~counter~0=v_~counter~0_289, ~c~0=v_~c~0_130, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_103|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_154, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_109|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_155|, ~N~0=v_~N~0_123} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:58,415 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:58,415 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:44:58,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:44:58,595 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:44:58,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 515 [2022-12-13 10:44:58,596 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 126 transitions, 1568 flow [2022-12-13 10:44:58,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-13 10:44:58,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:58,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:58,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 10:44:58,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:58,802 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-13 10:44:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1087763564, now seen corresponding path program 1 times [2022-12-13 10:44:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:58,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104286280] [2022-12-13 10:44:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:44:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:58,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104286280] [2022-12-13 10:44:58,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104286280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:58,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104383641] [2022-12-13 10:44:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:58,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:58,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:58,907 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:44:58,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 10:44:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:58,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:44:58,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:59,007 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-13 10:44:59,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:59,030 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-13 10:44:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104383641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:59,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:59,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:44:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929596038] [2022-12-13 10:44:59,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:59,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:44:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:44:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:44:59,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 10:44:59,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 126 transitions, 1568 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:59,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:59,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 10:44:59,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:44:59,270 INFO L130 PetriNetUnfolder]: 534/1094 cut-off events. [2022-12-13 10:44:59,270 INFO L131 PetriNetUnfolder]: For 9619/9619 co-relation queries the response was YES. [2022-12-13 10:44:59,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6077 conditions, 1094 events. 534/1094 cut-off events. For 9619/9619 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6469 event pairs, 215 based on Foata normal form. 20/1112 useless extension candidates. Maximal degree in co-relation 5467. Up to 872 conditions per place. [2022-12-13 10:44:59,280 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 123 selfloop transitions, 38 changer transitions 1/162 dead transitions. [2022-12-13 10:44:59,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 162 transitions, 2145 flow [2022-12-13 10:44:59,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:44:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:44:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-13 10:44:59,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2022-12-13 10:44:59,281 INFO L175 Difference]: Start difference. First operand has 88 places, 126 transitions, 1568 flow. Second operand 6 states and 58 transitions. [2022-12-13 10:44:59,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 162 transitions, 2145 flow [2022-12-13 10:44:59,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 162 transitions, 2033 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 10:44:59,304 INFO L231 Difference]: Finished difference. Result has 90 places, 130 transitions, 1627 flow [2022-12-13 10:44:59,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1627, PETRI_PLACES=90, PETRI_TRANSITIONS=130} [2022-12-13 10:44:59,305 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 70 predicate places. [2022-12-13 10:44:59,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:44:59,305 INFO L89 Accepts]: Start accepts. Operand has 90 places, 130 transitions, 1627 flow [2022-12-13 10:44:59,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:44:59,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:44:59,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 130 transitions, 1627 flow [2022-12-13 10:44:59,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 130 transitions, 1627 flow [2022-12-13 10:44:59,346 INFO L130 PetriNetUnfolder]: 122/445 cut-off events. [2022-12-13 10:44:59,346 INFO L131 PetriNetUnfolder]: For 3135/3136 co-relation queries the response was YES. [2022-12-13 10:44:59,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 445 events. 122/445 cut-off events. For 3135/3136 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3131 event pairs, 21 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1864. Up to 172 conditions per place. [2022-12-13 10:44:59,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 130 transitions, 1627 flow [2022-12-13 10:44:59,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-13 10:44:59,352 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:44:59,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 10:44:59,352 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 130 transitions, 1627 flow [2022-12-13 10:44:59,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:59,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:44:59,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:59,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 10:44:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:59,559 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-13 10:44:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:44:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 655800361, now seen corresponding path program 1 times [2022-12-13 10:44:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:44:59,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756933244] [2022-12-13 10:44:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:44:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:59,651 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-13 10:44:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:44:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756933244] [2022-12-13 10:44:59,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756933244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:44:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499384605] [2022-12-13 10:44:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:44:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:44:59,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:44:59,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 10:44:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:44:59,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:44:59,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:44:59,789 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-13 10:44:59,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:44:59,832 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-13 10:44:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499384605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:44:59,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:44:59,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:44:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805473951] [2022-12-13 10:44:59,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:44:59,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:44:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:44:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:44:59,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:44:59,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 10:44:59,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 130 transitions, 1627 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:44:59,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:44:59,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 10:44:59,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:00,253 INFO L130 PetriNetUnfolder]: 734/1497 cut-off events. [2022-12-13 10:45:00,253 INFO L131 PetriNetUnfolder]: For 17399/17399 co-relation queries the response was YES. [2022-12-13 10:45:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8934 conditions, 1497 events. 734/1497 cut-off events. For 17399/17399 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9519 event pairs, 136 based on Foata normal form. 52/1549 useless extension candidates. Maximal degree in co-relation 7453. Up to 661 conditions per place. [2022-12-13 10:45:00,267 INFO L137 encePairwiseOnDemand]: 16/35 looper letters, 166 selfloop transitions, 69 changer transitions 1/236 dead transitions. [2022-12-13 10:45:00,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 236 transitions, 3036 flow [2022-12-13 10:45:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 10:45:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 10:45:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-12-13 10:45:00,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24 [2022-12-13 10:45:00,271 INFO L175 Difference]: Start difference. First operand has 89 places, 130 transitions, 1627 flow. Second operand 15 states and 126 transitions. [2022-12-13 10:45:00,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 236 transitions, 3036 flow [2022-12-13 10:45:00,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 236 transitions, 2861 flow, removed 55 selfloop flow, removed 3 redundant places. [2022-12-13 10:45:00,315 INFO L231 Difference]: Finished difference. Result has 106 places, 145 transitions, 2017 flow [2022-12-13 10:45:00,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2017, PETRI_PLACES=106, PETRI_TRANSITIONS=145} [2022-12-13 10:45:00,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 86 predicate places. [2022-12-13 10:45:00,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:00,316 INFO L89 Accepts]: Start accepts. Operand has 106 places, 145 transitions, 2017 flow [2022-12-13 10:45:00,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:00,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:00,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 145 transitions, 2017 flow [2022-12-13 10:45:00,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 145 transitions, 2017 flow [2022-12-13 10:45:00,373 INFO L130 PetriNetUnfolder]: 165/604 cut-off events. [2022-12-13 10:45:00,373 INFO L131 PetriNetUnfolder]: For 6381/6381 co-relation queries the response was YES. [2022-12-13 10:45:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 604 events. 165/604 cut-off events. For 6381/6381 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4710 event pairs, 29 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 2792. Up to 248 conditions per place. [2022-12-13 10:45:00,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 145 transitions, 2017 flow [2022-12-13 10:45:00,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 10:45:00,381 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:00,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 10:45:00,382 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 145 transitions, 2017 flow [2022-12-13 10:45:00,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:00,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:00,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:00,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:00,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 10:45:00,588 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-13 10:45:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash -430505422, now seen corresponding path program 2 times [2022-12-13 10:45:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:00,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579407643] [2022-12-13 10:45:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:00,654 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-13 10:45:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:00,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579407643] [2022-12-13 10:45:00,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579407643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:00,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:00,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:45:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364667639] [2022-12-13 10:45:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:00,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:00,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:45:00,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 10:45:00,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 145 transitions, 2017 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:00,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:00,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 10:45:00,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:00,968 INFO L130 PetriNetUnfolder]: 781/1617 cut-off events. [2022-12-13 10:45:00,968 INFO L131 PetriNetUnfolder]: For 22865/22865 co-relation queries the response was YES. [2022-12-13 10:45:00,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 1617 events. 781/1617 cut-off events. For 22865/22865 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10702 event pairs, 337 based on Foata normal form. 2/1619 useless extension candidates. Maximal degree in co-relation 8594. Up to 1092 conditions per place. [2022-12-13 10:45:00,991 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 145 selfloop transitions, 33 changer transitions 4/182 dead transitions. [2022-12-13 10:45:00,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 182 transitions, 2862 flow [2022-12-13 10:45:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 10:45:00,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2022-12-13 10:45:00,992 INFO L175 Difference]: Start difference. First operand has 106 places, 145 transitions, 2017 flow. Second operand 4 states and 47 transitions. [2022-12-13 10:45:00,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 182 transitions, 2862 flow [2022-12-13 10:45:01,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 182 transitions, 2688 flow, removed 81 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:01,041 INFO L231 Difference]: Finished difference. Result has 108 places, 151 transitions, 2069 flow [2022-12-13 10:45:01,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2069, PETRI_PLACES=108, PETRI_TRANSITIONS=151} [2022-12-13 10:45:01,041 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2022-12-13 10:45:01,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:01,042 INFO L89 Accepts]: Start accepts. Operand has 108 places, 151 transitions, 2069 flow [2022-12-13 10:45:01,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:01,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:01,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 151 transitions, 2069 flow [2022-12-13 10:45:01,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 151 transitions, 2069 flow [2022-12-13 10:45:01,102 INFO L130 PetriNetUnfolder]: 162/617 cut-off events. [2022-12-13 10:45:01,102 INFO L131 PetriNetUnfolder]: For 6365/6384 co-relation queries the response was YES. [2022-12-13 10:45:01,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 617 events. 162/617 cut-off events. For 6365/6384 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4926 event pairs, 25 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 2914. Up to 258 conditions per place. [2022-12-13 10:45:01,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 151 transitions, 2069 flow [2022-12-13 10:45:01,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 10:45:01,110 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:01,110 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:01,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_347 v_~c~0_148))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_124| (ite (< 0 (mod .cse0 4294967296)) 1 0)) (< 5 (mod v_~N~0_141 4294967296)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_183|) (= v_~counter~0_345 .cse0) (= 6 v_thread1Thread1of1ForFork0_~i~0_187) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_124| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_124|) (not (= (ite (< 0 (mod (+ v_~counter~0_347 (* 2 v_~c~0_148)) 4294967296)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_124| 0)))) InVars {~counter~0=v_~counter~0_347, ~c~0=v_~c~0_148, ~N~0=v_~N~0_141} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_124|, ~counter~0=v_~counter~0_345, ~c~0=v_~c~0_148, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_132|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_187, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_132|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_124|, ~N~0=v_~N~0_141, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:01,248 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:01,249 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:01,442 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:45:01,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 401 [2022-12-13 10:45:01,443 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 151 transitions, 2096 flow [2022-12-13 10:45:01,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:01,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:01,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:01,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 10:45:01,444 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-13 10:45:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash -293379287, now seen corresponding path program 1 times [2022-12-13 10:45:01,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:01,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625002936] [2022-12-13 10:45:01,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:01,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:01,553 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-13 10:45:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625002936] [2022-12-13 10:45:01,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625002936] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886335494] [2022-12-13 10:45:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:01,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:01,556 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:01,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 10:45:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:01,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:01,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:01,658 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-13 10:45:01,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:01,702 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-13 10:45:01,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886335494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:01,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:01,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:45:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377671623] [2022-12-13 10:45:01,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:01,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:45:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:01,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:45:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:45:01,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 10:45:01,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 151 transitions, 2096 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:01,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:01,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 10:45:01,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:02,199 INFO L130 PetriNetUnfolder]: 823/1691 cut-off events. [2022-12-13 10:45:02,199 INFO L131 PetriNetUnfolder]: For 26903/26903 co-relation queries the response was YES. [2022-12-13 10:45:02,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 1691 events. 823/1691 cut-off events. For 26903/26903 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11205 event pairs, 307 based on Foata normal form. 64/1755 useless extension candidates. Maximal degree in co-relation 9683. Up to 1296 conditions per place. [2022-12-13 10:45:02,212 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 138 selfloop transitions, 72 changer transitions 3/213 dead transitions. [2022-12-13 10:45:02,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 213 transitions, 3094 flow [2022-12-13 10:45:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:45:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:45:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-12-13 10:45:02,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24411764705882352 [2022-12-13 10:45:02,214 INFO L175 Difference]: Start difference. First operand has 107 places, 151 transitions, 2096 flow. Second operand 10 states and 83 transitions. [2022-12-13 10:45:02,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 213 transitions, 3094 flow [2022-12-13 10:45:02,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 213 transitions, 2989 flow, removed 38 selfloop flow, removed 1 redundant places. [2022-12-13 10:45:02,269 INFO L231 Difference]: Finished difference. Result has 118 places, 167 transitions, 2557 flow [2022-12-13 10:45:02,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2005, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2557, PETRI_PLACES=118, PETRI_TRANSITIONS=167} [2022-12-13 10:45:02,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 98 predicate places. [2022-12-13 10:45:02,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:02,271 INFO L89 Accepts]: Start accepts. Operand has 118 places, 167 transitions, 2557 flow [2022-12-13 10:45:02,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:02,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:02,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 167 transitions, 2557 flow [2022-12-13 10:45:02,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 167 transitions, 2557 flow [2022-12-13 10:45:02,338 INFO L130 PetriNetUnfolder]: 169/642 cut-off events. [2022-12-13 10:45:02,339 INFO L131 PetriNetUnfolder]: For 8758/8775 co-relation queries the response was YES. [2022-12-13 10:45:02,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 642 events. 169/642 cut-off events. For 8758/8775 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5170 event pairs, 23 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 3469. Up to 277 conditions per place. [2022-12-13 10:45:02,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 167 transitions, 2557 flow [2022-12-13 10:45:02,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 10:45:02,348 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:02,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 10:45:02,348 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 167 transitions, 2557 flow [2022-12-13 10:45:02,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:02,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:02,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:02,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:02,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 10:45:02,554 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-13 10:45:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2040466514, now seen corresponding path program 1 times [2022-12-13 10:45:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:02,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064170946] [2022-12-13 10:45:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:02,649 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-13 10:45:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:02,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064170946] [2022-12-13 10:45:02,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064170946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:02,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641604000] [2022-12-13 10:45:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:02,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:02,652 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:02,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 10:45:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:02,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:02,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:02,748 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-13 10:45:02,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:02,776 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-13 10:45:02,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641604000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:02,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:02,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:45:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232374916] [2022-12-13 10:45:02,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:02,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:45:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:45:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:45:02,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 10:45:02,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 167 transitions, 2557 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:02,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:02,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 10:45:02,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:03,187 INFO L130 PetriNetUnfolder]: 1107/2245 cut-off events. [2022-12-13 10:45:03,187 INFO L131 PetriNetUnfolder]: For 47506/47506 co-relation queries the response was YES. [2022-12-13 10:45:03,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16136 conditions, 2245 events. 1107/2245 cut-off events. For 47506/47506 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15552 event pairs, 261 based on Foata normal form. 6/2251 useless extension candidates. Maximal degree in co-relation 14512. Up to 1065 conditions per place. [2022-12-13 10:45:03,205 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 118 selfloop transitions, 127 changer transitions 1/246 dead transitions. [2022-12-13 10:45:03,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 246 transitions, 4069 flow [2022-12-13 10:45:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:45:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:45:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 10:45:03,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3046875 [2022-12-13 10:45:03,207 INFO L175 Difference]: Start difference. First operand has 118 places, 167 transitions, 2557 flow. Second operand 8 states and 78 transitions. [2022-12-13 10:45:03,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 246 transitions, 4069 flow [2022-12-13 10:45:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 246 transitions, 3724 flow, removed 150 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:03,345 INFO L231 Difference]: Finished difference. Result has 126 places, 201 transitions, 3277 flow [2022-12-13 10:45:03,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3277, PETRI_PLACES=126, PETRI_TRANSITIONS=201} [2022-12-13 10:45:03,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2022-12-13 10:45:03,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:03,346 INFO L89 Accepts]: Start accepts. Operand has 126 places, 201 transitions, 3277 flow [2022-12-13 10:45:03,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:03,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:03,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 201 transitions, 3277 flow [2022-12-13 10:45:03,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 201 transitions, 3277 flow [2022-12-13 10:45:03,425 INFO L130 PetriNetUnfolder]: 234/867 cut-off events. [2022-12-13 10:45:03,426 INFO L131 PetriNetUnfolder]: For 13339/13356 co-relation queries the response was YES. [2022-12-13 10:45:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 867 events. 234/867 cut-off events. For 13339/13356 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7457 event pairs, 40 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 4869. Up to 344 conditions per place. [2022-12-13 10:45:03,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 201 transitions, 3277 flow [2022-12-13 10:45:03,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-13 10:45:03,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:03,505 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:03,505 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:03,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ (* 3 v_~c~0_142) v_~counter~0_327) 4294967296)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_170|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| .cse0) (= v_thread1Thread1of1ForFork0_~i~0_177 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|) (not (= .cse0 0)) (< 3 (mod v_~N~0_135 4294967296)) (= v_~counter~0_325 (+ v_~counter~0_327 (* 2 v_~c~0_142))))) InVars {~counter~0=v_~counter~0_327, ~c~0=v_~c~0_142, ~N~0=v_~N~0_135} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, ~counter~0=v_~counter~0_325, ~c~0=v_~c~0_142, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_177, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_121|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~N~0=v_~N~0_135} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:03,675 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:45:03,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-13 10:45:03,676 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 200 transitions, 3301 flow [2022-12-13 10:45:03,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:03,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:03,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:03,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:03,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:03,877 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-13 10:45:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1792565891, now seen corresponding path program 1 times [2022-12-13 10:45:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:03,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413915740] [2022-12-13 10:45:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:03,975 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-13 10:45:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:03,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413915740] [2022-12-13 10:45:03,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413915740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:03,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570271544] [2022-12-13 10:45:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:03,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:03,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:03,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 10:45:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:04,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:45:04,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:04,090 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-13 10:45:04,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:04,116 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-13 10:45:04,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570271544] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:04,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:04,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 4 [2022-12-13 10:45:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819122724] [2022-12-13 10:45:04,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:04,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:45:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:45:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:45:04,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 10:45:04,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 200 transitions, 3301 flow. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:04,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:04,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 10:45:04,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:04,579 INFO L130 PetriNetUnfolder]: 1120/2287 cut-off events. [2022-12-13 10:45:04,579 INFO L131 PetriNetUnfolder]: For 46951/46951 co-relation queries the response was YES. [2022-12-13 10:45:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16714 conditions, 2287 events. 1120/2287 cut-off events. For 46951/46951 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16052 event pairs, 284 based on Foata normal form. 21/2308 useless extension candidates. Maximal degree in co-relation 15075. Up to 1727 conditions per place. [2022-12-13 10:45:04,602 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 165 selfloop transitions, 57 changer transitions 8/230 dead transitions. [2022-12-13 10:45:04,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 230 transitions, 4102 flow [2022-12-13 10:45:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-13 10:45:04,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 10:45:04,603 INFO L175 Difference]: Start difference. First operand has 125 places, 200 transitions, 3301 flow. Second operand 4 states and 55 transitions. [2022-12-13 10:45:04,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 230 transitions, 4102 flow [2022-12-13 10:45:04,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 230 transitions, 3957 flow, removed 52 selfloop flow, removed 1 redundant places. [2022-12-13 10:45:04,718 INFO L231 Difference]: Finished difference. Result has 129 places, 208 transitions, 3484 flow [2022-12-13 10:45:04,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3484, PETRI_PLACES=129, PETRI_TRANSITIONS=208} [2022-12-13 10:45:04,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 109 predicate places. [2022-12-13 10:45:04,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:04,719 INFO L89 Accepts]: Start accepts. Operand has 129 places, 208 transitions, 3484 flow [2022-12-13 10:45:04,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:04,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:04,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 208 transitions, 3484 flow [2022-12-13 10:45:04,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 208 transitions, 3484 flow [2022-12-13 10:45:04,807 INFO L130 PetriNetUnfolder]: 234/874 cut-off events. [2022-12-13 10:45:04,807 INFO L131 PetriNetUnfolder]: For 13626/13644 co-relation queries the response was YES. [2022-12-13 10:45:04,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5433 conditions, 874 events. 234/874 cut-off events. For 13626/13644 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 7559 event pairs, 43 based on Foata normal form. 1/866 useless extension candidates. Maximal degree in co-relation 5288. Up to 346 conditions per place. [2022-12-13 10:45:04,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 208 transitions, 3484 flow [2022-12-13 10:45:04,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-13 10:45:04,815 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:04,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 10:45:04,816 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 208 transitions, 3484 flow [2022-12-13 10:45:04,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:04,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:04,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:04,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:05,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:05,022 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-13 10:45:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 492739816, now seen corresponding path program 1 times [2022-12-13 10:45:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:05,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115837976] [2022-12-13 10:45:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:05,089 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-13 10:45:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115837976] [2022-12-13 10:45:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115837976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981210499] [2022-12-13 10:45:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:05,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:05,091 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:05,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 10:45:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:05,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:45:05,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:05,186 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-13 10:45:05,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:05,215 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-13 10:45:05,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981210499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:05,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:05,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 10:45:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697048257] [2022-12-13 10:45:05,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:05,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:45:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:45:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:45:05,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 10:45:05,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 208 transitions, 3484 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-13 10:45:05,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:05,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 10:45:05,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:05,791 INFO L130 PetriNetUnfolder]: 1148/2357 cut-off events. [2022-12-13 10:45:05,791 INFO L131 PetriNetUnfolder]: For 52390/52390 co-relation queries the response was YES. [2022-12-13 10:45:05,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17316 conditions, 2357 events. 1148/2357 cut-off events. For 52390/52390 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16860 event pairs, 505 based on Foata normal form. 18/2375 useless extension candidates. Maximal degree in co-relation 16950. Up to 1998 conditions per place. [2022-12-13 10:45:05,813 INFO L137 encePairwiseOnDemand]: 14/35 looper letters, 184 selfloop transitions, 66 changer transitions 4/254 dead transitions. [2022-12-13 10:45:05,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 254 transitions, 4438 flow [2022-12-13 10:45:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:45:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:45:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 10:45:05,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-13 10:45:05,815 INFO L175 Difference]: Start difference. First operand has 128 places, 208 transitions, 3484 flow. Second operand 8 states and 80 transitions. [2022-12-13 10:45:05,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 254 transitions, 4438 flow [2022-12-13 10:45:05,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 254 transitions, 4394 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:05,919 INFO L231 Difference]: Finished difference. Result has 136 places, 213 transitions, 3792 flow [2022-12-13 10:45:05,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3792, PETRI_PLACES=136, PETRI_TRANSITIONS=213} [2022-12-13 10:45:05,920 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 116 predicate places. [2022-12-13 10:45:05,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:05,921 INFO L89 Accepts]: Start accepts. Operand has 136 places, 213 transitions, 3792 flow [2022-12-13 10:45:05,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:05,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:05,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 213 transitions, 3792 flow [2022-12-13 10:45:05,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 213 transitions, 3792 flow [2022-12-13 10:45:06,008 INFO L130 PetriNetUnfolder]: 242/917 cut-off events. [2022-12-13 10:45:06,009 INFO L131 PetriNetUnfolder]: For 16681/16699 co-relation queries the response was YES. [2022-12-13 10:45:06,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5892 conditions, 917 events. 242/917 cut-off events. For 16681/16699 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8052 event pairs, 45 based on Foata normal form. 1/910 useless extension candidates. Maximal degree in co-relation 5743. Up to 362 conditions per place. [2022-12-13 10:45:06,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 213 transitions, 3792 flow [2022-12-13 10:45:06,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 10:45:06,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_376 v_~c~0_156) 4294967296)) 1 0))) (and (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| .cse0) (= 6 v_thread1Thread1of1ForFork0_~i~0_200) (not (= (ite (< 0 (mod (+ v_~counter~0_376 (* 2 v_~c~0_156)) 4294967296)) 1 0) 0)) (< 5 (mod v_~N~0_149 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_202|) (= v_~counter~0_376 v_~counter~0_374))) InVars {~counter~0=v_~counter~0_376, ~c~0=v_~c~0_156, ~N~0=v_~N~0_149} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, ~counter~0=v_~counter~0_374, ~c~0=v_~c~0_156, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_200, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_149|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_202|, ~N~0=v_~N~0_149} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:06,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:06,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-13 10:45:06,155 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 213 transitions, 3802 flow [2022-12-13 10:45:06,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-13 10:45:06,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:06,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:06,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 10:45:06,360 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1537930618, now seen corresponding path program 1 times [2022-12-13 10:45:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:06,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128603998] [2022-12-13 10:45:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:06,468 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-13 10:45:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:06,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128603998] [2022-12-13 10:45:06,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128603998] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:06,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645491544] [2022-12-13 10:45:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:06,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:06,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:06,470 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:06,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 10:45:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:06,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:45:06,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:06,579 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-13 10:45:06,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:06,608 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-13 10:45:06,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645491544] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:06,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:06,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 10:45:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084810272] [2022-12-13 10:45:06,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:06,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:45:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:06,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:45:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:45:06,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 10:45:06,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 213 transitions, 3802 flow. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:06,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:06,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 10:45:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:07,000 INFO L130 PetriNetUnfolder]: 1147/2357 cut-off events. [2022-12-13 10:45:07,000 INFO L131 PetriNetUnfolder]: For 55021/55021 co-relation queries the response was YES. [2022-12-13 10:45:07,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 2357 events. 1147/2357 cut-off events. For 55021/55021 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 16881 event pairs, 264 based on Foata normal form. 5/2362 useless extension candidates. Maximal degree in co-relation 17518. Up to 2300 conditions per place. [2022-12-13 10:45:07,022 INFO L137 encePairwiseOnDemand]: 19/36 looper letters, 201 selfloop transitions, 17 changer transitions 10/228 dead transitions. [2022-12-13 10:45:07,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 228 transitions, 4384 flow [2022-12-13 10:45:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 10:45:07,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2022-12-13 10:45:07,024 INFO L175 Difference]: Start difference. First operand has 136 places, 213 transitions, 3802 flow. Second operand 4 states and 53 transitions. [2022-12-13 10:45:07,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 228 transitions, 4384 flow [2022-12-13 10:45:07,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 228 transitions, 4312 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-12-13 10:45:07,179 INFO L231 Difference]: Finished difference. Result has 140 places, 213 transitions, 3764 flow [2022-12-13 10:45:07,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3731, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3764, PETRI_PLACES=140, PETRI_TRANSITIONS=213} [2022-12-13 10:45:07,180 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 120 predicate places. [2022-12-13 10:45:07,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:07,181 INFO L89 Accepts]: Start accepts. Operand has 140 places, 213 transitions, 3764 flow [2022-12-13 10:45:07,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:07,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:07,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 213 transitions, 3764 flow [2022-12-13 10:45:07,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 213 transitions, 3764 flow [2022-12-13 10:45:07,296 INFO L130 PetriNetUnfolder]: 242/914 cut-off events. [2022-12-13 10:45:07,297 INFO L131 PetriNetUnfolder]: For 17121/17139 co-relation queries the response was YES. [2022-12-13 10:45:07,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5908 conditions, 914 events. 242/914 cut-off events. For 17121/17139 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8016 event pairs, 43 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 5810. Up to 359 conditions per place. [2022-12-13 10:45:07,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 213 transitions, 3764 flow [2022-12-13 10:45:07,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-13 10:45:07,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] $Ultimate##0-->L41-4: Formula: (let ((.cse1 (+ (* 3 v_~c~0_162) v_~counter~0_400))) (let ((.cse0 (ite (< 0 (mod .cse1 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| .cse0) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_210) 4294967296) (mod v_~N~0_155 4294967296)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|) (= v_~counter~0_398 .cse1) (= 5 v_thread1Thread1of1ForFork0_~i~0_210) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_222|)))) InVars {~counter~0=v_~counter~0_400, ~c~0=v_~c~0_162, ~N~0=v_~N~0_155} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|, ~counter~0=v_~counter~0_398, ~c~0=v_~c~0_162, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_151|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_210, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_163|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, ~N~0=v_~N~0_155, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_222|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:07,311 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:07,311 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:07,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_239 (+ v_~counter~0_241 (* 2 v_~c~0_112))) (< 2 (mod v_~N~0_101 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_116| 1) (= 3 v_thread1Thread1of1ForFork0_~i~0_120) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (ite (< 0 (mod (+ v_~counter~0_241 v_~c~0_112) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|)) InVars {~counter~0=v_~counter~0_241, ~c~0=v_~c~0_112, ~N~0=v_~N~0_101} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, ~counter~0=v_~counter~0_239, ~c~0=v_~c~0_112, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_87|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_120, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_90|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, ~N~0=v_~N~0_101, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:07,449 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:07,449 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:07,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] $Ultimate##0-->L51-4: Formula: (and (= v_~counter~0_353 (+ v_~counter~0_351 (* 2 v_~c~0_150))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_126| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_126|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_126| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_185|) (< 1 (mod v_~N~0_143 4294967296)) (not (= (ite (< 0 (mod v_~counter~0_353 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_126| (ite (< 0 (mod (+ v_~counter~0_351 v_~c~0_150) 4294967296)) 1 0))) InVars {~counter~0=v_~counter~0_353, ~c~0=v_~c~0_150, ~N~0=v_~N~0_143} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_126|, ~counter~0=v_~counter~0_351, ~c~0=v_~c~0_150, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_134|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_126|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~N~0=v_~N~0_143} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:07,742 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:45:07,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 563 [2022-12-13 10:45:07,743 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 213 transitions, 3840 flow [2022-12-13 10:45:07,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:07,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:07,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:07,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:07,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 10:45:07,944 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash -422735266, now seen corresponding path program 2 times [2022-12-13 10:45:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:07,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459730127] [2022-12-13 10:45:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:08,016 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-13 10:45:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459730127] [2022-12-13 10:45:08,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459730127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:08,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:08,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:45:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538137764] [2022-12-13 10:45:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:08,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:45:08,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:45:08,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 213 transitions, 3840 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:08,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:08,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:45:08,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:08,471 INFO L130 PetriNetUnfolder]: 1193/2458 cut-off events. [2022-12-13 10:45:08,471 INFO L131 PetriNetUnfolder]: For 60140/60140 co-relation queries the response was YES. [2022-12-13 10:45:08,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18922 conditions, 2458 events. 1193/2458 cut-off events. For 60140/60140 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 17828 event pairs, 526 based on Foata normal form. 4/2460 useless extension candidates. Maximal degree in co-relation 18562. Up to 1633 conditions per place. [2022-12-13 10:45:08,488 INFO L137 encePairwiseOnDemand]: 18/38 looper letters, 211 selfloop transitions, 48 changer transitions 5/264 dead transitions. [2022-12-13 10:45:08,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 264 transitions, 5220 flow [2022-12-13 10:45:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 10:45:08,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2022-12-13 10:45:08,489 INFO L175 Difference]: Start difference. First operand has 139 places, 213 transitions, 3840 flow. Second operand 4 states and 52 transitions. [2022-12-13 10:45:08,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 264 transitions, 5220 flow [2022-12-13 10:45:08,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 264 transitions, 5110 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-13 10:45:08,584 INFO L231 Difference]: Finished difference. Result has 139 places, 221 transitions, 4034 flow [2022-12-13 10:45:08,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3707, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4034, PETRI_PLACES=139, PETRI_TRANSITIONS=221} [2022-12-13 10:45:08,584 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 119 predicate places. [2022-12-13 10:45:08,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:08,584 INFO L89 Accepts]: Start accepts. Operand has 139 places, 221 transitions, 4034 flow [2022-12-13 10:45:08,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:08,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:08,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 221 transitions, 4034 flow [2022-12-13 10:45:08,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 221 transitions, 4034 flow [2022-12-13 10:45:08,684 INFO L130 PetriNetUnfolder]: 243/923 cut-off events. [2022-12-13 10:45:08,684 INFO L131 PetriNetUnfolder]: For 18500/18500 co-relation queries the response was YES. [2022-12-13 10:45:08,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6249 conditions, 923 events. 243/923 cut-off events. For 18500/18500 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8168 event pairs, 41 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 6099. Up to 363 conditions per place. [2022-12-13 10:45:08,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 221 transitions, 4034 flow [2022-12-13 10:45:08,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-13 10:45:08,695 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_412 v_~c~0_164))) (let ((.cse1 (ite (< 0 (mod .cse0 4294967296)) 1 0))) (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_218) 4294967296) (mod v_~N~0_157 4294967296)) (= 7 v_thread1Thread1of1ForFork0_~i~0_218) (= v_~counter~0_410 .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| .cse1) (not (= .cse1 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_412 (* 2 v_~c~0_164)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_228|)))) InVars {~counter~0=v_~counter~0_412, ~c~0=v_~c~0_164, ~N~0=v_~N~0_157} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, ~counter~0=v_~counter~0_410, ~c~0=v_~c~0_164, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_159|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_218, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_169|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161|, ~N~0=v_~N~0_157, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_228|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:08,695 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:08,695 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:08,879 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:08,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 296 [2022-12-13 10:45:08,880 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 221 transitions, 4049 flow [2022-12-13 10:45:08,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:08,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:08,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:08,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 10:45:08,880 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash -591295232, now seen corresponding path program 1 times [2022-12-13 10:45:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:08,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272111083] [2022-12-13 10:45:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:08,961 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-13 10:45:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:08,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272111083] [2022-12-13 10:45:08,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272111083] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:08,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200521970] [2022-12-13 10:45:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:08,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:08,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:08,963 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:08,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 10:45:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:09,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:45:09,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:09,064 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-13 10:45:09,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:09,089 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-13 10:45:09,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200521970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:09,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:09,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 10:45:09,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465164950] [2022-12-13 10:45:09,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:09,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:45:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:09,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:45:09,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:45:09,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:45:09,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 221 transitions, 4049 flow. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:09,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:09,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:45:09,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:09,548 INFO L130 PetriNetUnfolder]: 1202/2478 cut-off events. [2022-12-13 10:45:09,548 INFO L131 PetriNetUnfolder]: For 66300/66300 co-relation queries the response was YES. [2022-12-13 10:45:09,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 2478 events. 1202/2478 cut-off events. For 66300/66300 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 17866 event pairs, 308 based on Foata normal form. 12/2490 useless extension candidates. Maximal degree in co-relation 18948. Up to 1857 conditions per place. [2022-12-13 10:45:09,563 INFO L137 encePairwiseOnDemand]: 20/37 looper letters, 177 selfloop transitions, 65 changer transitions 9/251 dead transitions. [2022-12-13 10:45:09,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 251 transitions, 4937 flow [2022-12-13 10:45:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 10:45:09,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38513513513513514 [2022-12-13 10:45:09,565 INFO L175 Difference]: Start difference. First operand has 137 places, 221 transitions, 4049 flow. Second operand 4 states and 57 transitions. [2022-12-13 10:45:09,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 251 transitions, 4937 flow [2022-12-13 10:45:09,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 251 transitions, 4854 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 10:45:09,669 INFO L231 Difference]: Finished difference. Result has 139 places, 227 transitions, 4306 flow [2022-12-13 10:45:09,669 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3970, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4306, PETRI_PLACES=139, PETRI_TRANSITIONS=227} [2022-12-13 10:45:09,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 119 predicate places. [2022-12-13 10:45:09,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:09,670 INFO L89 Accepts]: Start accepts. Operand has 139 places, 227 transitions, 4306 flow [2022-12-13 10:45:09,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:09,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:09,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 227 transitions, 4306 flow [2022-12-13 10:45:09,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 227 transitions, 4306 flow [2022-12-13 10:45:09,756 INFO L130 PetriNetUnfolder]: 248/951 cut-off events. [2022-12-13 10:45:09,756 INFO L131 PetriNetUnfolder]: For 20466/20503 co-relation queries the response was YES. [2022-12-13 10:45:09,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6685 conditions, 951 events. 248/951 cut-off events. For 20466/20503 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8504 event pairs, 43 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 6198. Up to 372 conditions per place. [2022-12-13 10:45:09,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 227 transitions, 4306 flow [2022-12-13 10:45:09,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 782 [2022-12-13 10:45:09,766 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:09,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 10:45:09,766 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 227 transitions, 4306 flow [2022-12-13 10:45:09,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:09,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:09,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:09,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:09,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 10:45:09,967 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2136409261, now seen corresponding path program 1 times [2022-12-13 10:45:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909589303] [2022-12-13 10:45:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:10,029 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-13 10:45:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:10,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909589303] [2022-12-13 10:45:10,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909589303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:10,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659453393] [2022-12-13 10:45:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:10,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:10,032 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:10,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 10:45:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:10,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:10,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:10,149 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-13 10:45:10,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:10,171 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-13 10:45:10,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659453393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:10,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:10,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:45:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347174372] [2022-12-13 10:45:10,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:45:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:45:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:45:10,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:45:10,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 227 transitions, 4306 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:10,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:10,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:45:10,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:10,669 INFO L130 PetriNetUnfolder]: 1190/2449 cut-off events. [2022-12-13 10:45:10,669 INFO L131 PetriNetUnfolder]: For 67989/67989 co-relation queries the response was YES. [2022-12-13 10:45:10,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19854 conditions, 2449 events. 1190/2449 cut-off events. For 67989/67989 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 17703 event pairs, 553 based on Foata normal form. 6/2455 useless extension candidates. Maximal degree in co-relation 18180. Up to 2201 conditions per place. [2022-12-13 10:45:10,686 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 187 selfloop transitions, 58 changer transitions 4/249 dead transitions. [2022-12-13 10:45:10,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 249 transitions, 4990 flow [2022-12-13 10:45:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:45:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:45:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-13 10:45:10,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2972972972972973 [2022-12-13 10:45:10,687 INFO L175 Difference]: Start difference. First operand has 139 places, 227 transitions, 4306 flow. Second operand 5 states and 55 transitions. [2022-12-13 10:45:10,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 249 transitions, 4990 flow [2022-12-13 10:45:10,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 249 transitions, 4976 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 10:45:10,778 INFO L231 Difference]: Finished difference. Result has 145 places, 228 transitions, 4478 flow [2022-12-13 10:45:10,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4265, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4478, PETRI_PLACES=145, PETRI_TRANSITIONS=228} [2022-12-13 10:45:10,778 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 125 predicate places. [2022-12-13 10:45:10,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:10,778 INFO L89 Accepts]: Start accepts. Operand has 145 places, 228 transitions, 4478 flow [2022-12-13 10:45:10,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:10,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:10,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 228 transitions, 4478 flow [2022-12-13 10:45:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 228 transitions, 4478 flow [2022-12-13 10:45:10,868 INFO L130 PetriNetUnfolder]: 247/946 cut-off events. [2022-12-13 10:45:10,868 INFO L131 PetriNetUnfolder]: For 21365/21402 co-relation queries the response was YES. [2022-12-13 10:45:10,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 946 events. 247/946 cut-off events. For 21365/21402 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8421 event pairs, 42 based on Foata normal form. 1/941 useless extension candidates. Maximal degree in co-relation 6186. Up to 369 conditions per place. [2022-12-13 10:45:10,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 228 transitions, 4478 flow [2022-12-13 10:45:10,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 10:45:10,878 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:10,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 10:45:10,879 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 228 transitions, 4478 flow [2022-12-13 10:45:10,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:10,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:10,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:10,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:11,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:11,080 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1529331723, now seen corresponding path program 1 times [2022-12-13 10:45:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:11,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962623571] [2022-12-13 10:45:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:11,146 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-13 10:45:11,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:11,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962623571] [2022-12-13 10:45:11,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962623571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:11,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533274204] [2022-12-13 10:45:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:11,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:11,148 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:11,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 10:45:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:11,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:45:11,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:11,279 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-13 10:45:11,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:11,303 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-13 10:45:11,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533274204] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:11,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 10:45:11,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-13 10:45:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826374764] [2022-12-13 10:45:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:11,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:11,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:11,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:45:11,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:45:11,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 228 transitions, 4478 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:11,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:11,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:45:11,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:11,777 INFO L130 PetriNetUnfolder]: 1318/2831 cut-off events. [2022-12-13 10:45:11,777 INFO L131 PetriNetUnfolder]: For 85477/85477 co-relation queries the response was YES. [2022-12-13 10:45:11,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23362 conditions, 2831 events. 1318/2831 cut-off events. For 85477/85477 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 22086 event pairs, 342 based on Foata normal form. 12/2843 useless extension candidates. Maximal degree in co-relation 21448. Up to 1660 conditions per place. [2022-12-13 10:45:11,797 INFO L137 encePairwiseOnDemand]: 13/37 looper letters, 159 selfloop transitions, 124 changer transitions 11/294 dead transitions. [2022-12-13 10:45:11,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 294 transitions, 6257 flow [2022-12-13 10:45:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 10:45:11,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38513513513513514 [2022-12-13 10:45:11,799 INFO L175 Difference]: Start difference. First operand has 145 places, 228 transitions, 4478 flow. Second operand 4 states and 57 transitions. [2022-12-13 10:45:11,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 294 transitions, 6257 flow [2022-12-13 10:45:11,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 294 transitions, 6171 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:11,947 INFO L231 Difference]: Finished difference. Result has 149 places, 263 transitions, 5728 flow [2022-12-13 10:45:11,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4392, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5728, PETRI_PLACES=149, PETRI_TRANSITIONS=263} [2022-12-13 10:45:11,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 129 predicate places. [2022-12-13 10:45:11,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:11,947 INFO L89 Accepts]: Start accepts. Operand has 149 places, 263 transitions, 5728 flow [2022-12-13 10:45:11,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:11,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:11,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 263 transitions, 5728 flow [2022-12-13 10:45:11,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 263 transitions, 5728 flow [2022-12-13 10:45:12,057 INFO L130 PetriNetUnfolder]: 246/1042 cut-off events. [2022-12-13 10:45:12,058 INFO L131 PetriNetUnfolder]: For 26257/26259 co-relation queries the response was YES. [2022-12-13 10:45:12,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7956 conditions, 1042 events. 246/1042 cut-off events. For 26257/26259 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 9802 event pairs, 33 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 7256. Up to 406 conditions per place. [2022-12-13 10:45:12,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 263 transitions, 5728 flow [2022-12-13 10:45:12,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 902 [2022-12-13 10:45:12,070 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:12,070 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:12,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:12,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 288 [2022-12-13 10:45:12,235 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 263 transitions, 5733 flow [2022-12-13 10:45:12,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:12,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:12,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:12,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:12,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 10:45:12,441 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2057007411, now seen corresponding path program 2 times [2022-12-13 10:45:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:12,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655784765] [2022-12-13 10:45:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:12,504 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-13 10:45:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655784765] [2022-12-13 10:45:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655784765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:12,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:12,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:45:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941174956] [2022-12-13 10:45:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:12,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:45:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:45:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:45:12,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:45:12,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 263 transitions, 5733 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:12,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:12,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:45:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:13,037 INFO L130 PetriNetUnfolder]: 1280/2731 cut-off events. [2022-12-13 10:45:13,037 INFO L131 PetriNetUnfolder]: For 88325/88325 co-relation queries the response was YES. [2022-12-13 10:45:13,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24079 conditions, 2731 events. 1280/2731 cut-off events. For 88325/88325 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20781 event pairs, 588 based on Foata normal form. 2/2733 useless extension candidates. Maximal degree in co-relation 21886. Up to 1888 conditions per place. [2022-12-13 10:45:13,055 INFO L137 encePairwiseOnDemand]: 19/38 looper letters, 245 selfloop transitions, 51 changer transitions 3/299 dead transitions. [2022-12-13 10:45:13,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 299 transitions, 6995 flow [2022-12-13 10:45:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 10:45:13,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2022-12-13 10:45:13,057 INFO L175 Difference]: Start difference. First operand has 149 places, 263 transitions, 5733 flow. Second operand 4 states and 52 transitions. [2022-12-13 10:45:13,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 299 transitions, 6995 flow [2022-12-13 10:45:13,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 299 transitions, 6884 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:13,195 INFO L231 Difference]: Finished difference. Result has 151 places, 263 transitions, 5799 flow [2022-12-13 10:45:13,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5603, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5799, PETRI_PLACES=151, PETRI_TRANSITIONS=263} [2022-12-13 10:45:13,195 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 131 predicate places. [2022-12-13 10:45:13,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:13,195 INFO L89 Accepts]: Start accepts. Operand has 151 places, 263 transitions, 5799 flow [2022-12-13 10:45:13,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:13,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:13,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 263 transitions, 5799 flow [2022-12-13 10:45:13,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 263 transitions, 5799 flow [2022-12-13 10:45:13,298 INFO L130 PetriNetUnfolder]: 243/1036 cut-off events. [2022-12-13 10:45:13,298 INFO L131 PetriNetUnfolder]: For 26405/26407 co-relation queries the response was YES. [2022-12-13 10:45:13,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1036 events. 243/1036 cut-off events. For 26405/26407 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 9762 event pairs, 33 based on Foata normal form. 1/1030 useless extension candidates. Maximal degree in co-relation 7304. Up to 405 conditions per place. [2022-12-13 10:45:13,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 263 transitions, 5799 flow [2022-12-13 10:45:13,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 898 [2022-12-13 10:45:13,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:13,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 10:45:13,311 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 263 transitions, 5799 flow [2022-12-13 10:45:13,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:13,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:13,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 10:45:13,312 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1706663850, now seen corresponding path program 1 times [2022-12-13 10:45:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:13,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399345347] [2022-12-13 10:45:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:13,388 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-13 10:45:13,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:13,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399345347] [2022-12-13 10:45:13,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399345347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:13,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233263768] [2022-12-13 10:45:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:13,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:13,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:13,391 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:13,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 10:45:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:13,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:13,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:13,509 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-13 10:45:13,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:13,548 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-13 10:45:13,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233263768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:13,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:13,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 10:45:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482670947] [2022-12-13 10:45:13,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:13,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:45:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:45:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:45:13,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:45:13,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 263 transitions, 5799 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-13 10:45:13,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:13,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:45:13,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:14,281 INFO L130 PetriNetUnfolder]: 1582/3350 cut-off events. [2022-12-13 10:45:14,281 INFO L131 PetriNetUnfolder]: For 110542/110542 co-relation queries the response was YES. [2022-12-13 10:45:14,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29917 conditions, 3350 events. 1582/3350 cut-off events. For 110542/110542 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 26253 event pairs, 244 based on Foata normal form. 2/3352 useless extension candidates. Maximal degree in co-relation 27825. Up to 1485 conditions per place. [2022-12-13 10:45:14,321 INFO L137 encePairwiseOnDemand]: 13/38 looper letters, 179 selfloop transitions, 244 changer transitions 3/426 dead transitions. [2022-12-13 10:45:14,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 426 transitions, 9234 flow [2022-12-13 10:45:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:45:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:45:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-12-13 10:45:14,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2741228070175439 [2022-12-13 10:45:14,323 INFO L175 Difference]: Start difference. First operand has 151 places, 263 transitions, 5799 flow. Second operand 12 states and 125 transitions. [2022-12-13 10:45:14,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 426 transitions, 9234 flow [2022-12-13 10:45:14,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 426 transitions, 9189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:45:14,548 INFO L231 Difference]: Finished difference. Result has 168 places, 320 transitions, 7892 flow [2022-12-13 10:45:14,549 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5755, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7892, PETRI_PLACES=168, PETRI_TRANSITIONS=320} [2022-12-13 10:45:14,549 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 148 predicate places. [2022-12-13 10:45:14,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:14,549 INFO L89 Accepts]: Start accepts. Operand has 168 places, 320 transitions, 7892 flow [2022-12-13 10:45:14,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:14,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:14,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 320 transitions, 7892 flow [2022-12-13 10:45:14,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 320 transitions, 7892 flow [2022-12-13 10:45:14,712 INFO L130 PetriNetUnfolder]: 305/1281 cut-off events. [2022-12-13 10:45:14,712 INFO L131 PetriNetUnfolder]: For 36701/36703 co-relation queries the response was YES. [2022-12-13 10:45:14,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10767 conditions, 1281 events. 305/1281 cut-off events. For 36701/36703 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 12741 event pairs, 44 based on Foata normal form. 1/1271 useless extension candidates. Maximal degree in co-relation 10194. Up to 519 conditions per place. [2022-12-13 10:45:14,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 320 transitions, 7892 flow [2022-12-13 10:45:14,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 1124 [2022-12-13 10:45:14,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L41-4: Formula: (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_228) 4294967296) (mod v_~N~0_163 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_174| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_241| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_174|) (= v_thread1Thread1of1ForFork0_~i~0_228 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| (ite (< 0 (mod (+ v_~counter~0_434 v_~c~0_170) 4294967296)) 1 0)) (= v_~counter~0_432 (+ v_~counter~0_434 (* 3 v_~c~0_170)))) InVars {~counter~0=v_~counter~0_434, ~c~0=v_~c~0_170, ~N~0=v_~N~0_163} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_174|, ~counter~0=v_~counter~0_432, ~c~0=v_~c~0_170, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_169|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_228, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_182|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174|, ~N~0=v_~N~0_163, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_241|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:14,728 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:14,728 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:14,848 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:14,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-13 10:45:14,848 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 320 transitions, 7912 flow [2022-12-13 10:45:14,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-13 10:45:14,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:14,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:14,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:15,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 10:45:15,049 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash -558937535, now seen corresponding path program 1 times [2022-12-13 10:45:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:15,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347994459] [2022-12-13 10:45:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:15,142 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-13 10:45:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347994459] [2022-12-13 10:45:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347994459] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501116500] [2022-12-13 10:45:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:15,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:15,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:15,144 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:15,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 10:45:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:15,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:45:15,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:15,238 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-13 10:45:15,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:15,272 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-13 10:45:15,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501116500] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:15,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:15,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 10:45:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822073140] [2022-12-13 10:45:15,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:45:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:45:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:45:15,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 10:45:15,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 320 transitions, 7912 flow. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 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-13 10:45:15,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:15,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 10:45:15,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:15,996 INFO L130 PetriNetUnfolder]: 1596/3406 cut-off events. [2022-12-13 10:45:15,996 INFO L131 PetriNetUnfolder]: For 127784/127784 co-relation queries the response was YES. [2022-12-13 10:45:16,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32758 conditions, 3406 events. 1596/3406 cut-off events. For 127784/127784 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 26872 event pairs, 451 based on Foata normal form. 36/3442 useless extension candidates. Maximal degree in co-relation 30769. Up to 2627 conditions per place. [2022-12-13 10:45:16,023 INFO L137 encePairwiseOnDemand]: 18/39 looper letters, 249 selfloop transitions, 92 changer transitions 18/359 dead transitions. [2022-12-13 10:45:16,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 359 transitions, 9176 flow [2022-12-13 10:45:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:45:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:45:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 10:45:16,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2022-12-13 10:45:16,024 INFO L175 Difference]: Start difference. First operand has 168 places, 320 transitions, 7912 flow. Second operand 5 states and 67 transitions. [2022-12-13 10:45:16,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 359 transitions, 9176 flow [2022-12-13 10:45:16,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 359 transitions, 8993 flow, removed 76 selfloop flow, removed 1 redundant places. [2022-12-13 10:45:16,250 INFO L231 Difference]: Finished difference. Result has 173 places, 324 transitions, 8134 flow [2022-12-13 10:45:16,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7677, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8134, PETRI_PLACES=173, PETRI_TRANSITIONS=324} [2022-12-13 10:45:16,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 153 predicate places. [2022-12-13 10:45:16,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:16,251 INFO L89 Accepts]: Start accepts. Operand has 173 places, 324 transitions, 8134 flow [2022-12-13 10:45:16,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:16,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:16,254 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 324 transitions, 8134 flow [2022-12-13 10:45:16,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 324 transitions, 8134 flow [2022-12-13 10:45:16,431 INFO L130 PetriNetUnfolder]: 304/1289 cut-off events. [2022-12-13 10:45:16,432 INFO L131 PetriNetUnfolder]: For 38773/38773 co-relation queries the response was YES. [2022-12-13 10:45:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11149 conditions, 1289 events. 304/1289 cut-off events. For 38773/38773 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 12832 event pairs, 46 based on Foata normal form. 0/1279 useless extension candidates. Maximal degree in co-relation 10918. Up to 516 conditions per place. [2022-12-13 10:45:16,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 324 transitions, 8134 flow [2022-12-13 10:45:16,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 1116 [2022-12-13 10:45:16,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:16,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:16,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-13 10:45:16,542 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 323 transitions, 8124 flow [2022-12-13 10:45:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 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-13 10:45:16,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:16,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:16,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:16,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:16,743 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 466285560, now seen corresponding path program 1 times [2022-12-13 10:45:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967379303] [2022-12-13 10:45:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:16,838 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-13 10:45:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967379303] [2022-12-13 10:45:16,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967379303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170576957] [2022-12-13 10:45:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:16,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:16,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:16,844 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:16,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 10:45:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:16,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:45:16,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:17,009 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-13 10:45:17,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:17,082 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-13 10:45:17,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170576957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:17,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:45:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391477786] [2022-12-13 10:45:17,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:17,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:45:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:45:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:45:17,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:45:17,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 323 transitions, 8124 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:17,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:17,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:45:17,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:18,030 INFO L130 PetriNetUnfolder]: 1646/3494 cut-off events. [2022-12-13 10:45:18,031 INFO L131 PetriNetUnfolder]: For 136432/136432 co-relation queries the response was YES. [2022-12-13 10:45:18,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34328 conditions, 3494 events. 1646/3494 cut-off events. For 136432/136432 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 28047 event pairs, 339 based on Foata normal form. 26/3520 useless extension candidates. Maximal degree in co-relation 33645. Up to 3038 conditions per place. [2022-12-13 10:45:18,061 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 286 selfloop transitions, 107 changer transitions 7/400 dead transitions. [2022-12-13 10:45:18,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 400 transitions, 10073 flow [2022-12-13 10:45:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:45:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:45:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2022-12-13 10:45:18,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.225 [2022-12-13 10:45:18,063 INFO L175 Difference]: Start difference. First operand has 172 places, 323 transitions, 8124 flow. Second operand 11 states and 99 transitions. [2022-12-13 10:45:18,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 400 transitions, 10073 flow [2022-12-13 10:45:18,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 400 transitions, 10002 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:18,296 INFO L231 Difference]: Finished difference. Result has 186 places, 350 transitions, 9165 flow [2022-12-13 10:45:18,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8054, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9165, PETRI_PLACES=186, PETRI_TRANSITIONS=350} [2022-12-13 10:45:18,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 166 predicate places. [2022-12-13 10:45:18,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:18,297 INFO L89 Accepts]: Start accepts. Operand has 186 places, 350 transitions, 9165 flow [2022-12-13 10:45:18,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:18,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:18,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 350 transitions, 9165 flow [2022-12-13 10:45:18,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 350 transitions, 9165 flow [2022-12-13 10:45:18,466 INFO L130 PetriNetUnfolder]: 319/1337 cut-off events. [2022-12-13 10:45:18,467 INFO L131 PetriNetUnfolder]: For 52380/52380 co-relation queries the response was YES. [2022-12-13 10:45:18,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12850 conditions, 1337 events. 319/1337 cut-off events. For 52380/52380 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 13401 event pairs, 45 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 12559. Up to 535 conditions per place. [2022-12-13 10:45:18,484 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 350 transitions, 9165 flow [2022-12-13 10:45:18,484 INFO L226 LiptonReduction]: Number of co-enabled transitions 1208 [2022-12-13 10:45:18,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:18,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] $Ultimate##0-->L51-4: Formula: (and (not (= (ite (< 0 (mod (+ v_~counter~0_470 v_~c~0_178) 4294967296)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_195| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_195|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_264|) (= v_~counter~0_468 (+ v_~counter~0_470 (* 2 v_~c~0_178))) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_246) 4294967296) (mod v_~N~0_171 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (< 0 (mod (+ v_~counter~0_468 v_~c~0_178) 4294967296)) 1 0)) (= v_thread1Thread1of1ForFork0_~i~0_246 4)) InVars {~counter~0=v_~counter~0_470, ~c~0=v_~c~0_178, ~N~0=v_~N~0_171} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_195|, ~counter~0=v_~counter~0_468, ~c~0=v_~c~0_178, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_185|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_246, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_203|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_264|, ~N~0=v_~N~0_171} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:18,706 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:18,706 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:18,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 10:45:18,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:18,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] L51-4-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_1| 4294967296) (mod v_~N~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N~0=v_~N~0_In_1, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:19,119 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:45:19,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 822 [2022-12-13 10:45:19,120 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 347 transitions, 9279 flow [2022-12-13 10:45:19,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:19,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:19,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:19,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:19,321 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2089653626, now seen corresponding path program 1 times [2022-12-13 10:45:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781990546] [2022-12-13 10:45:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:19,465 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-13 10:45:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:19,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781990546] [2022-12-13 10:45:19,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781990546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:19,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765489143] [2022-12-13 10:45:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:19,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:19,472 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:19,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 10:45:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:19,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:19,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:19,590 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-13 10:45:19,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:19,623 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-13 10:45:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765489143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:19,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:19,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 10:45:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028867632] [2022-12-13 10:45:19,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:19,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:45:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:19,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:45:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:45:19,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:45:19,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 347 transitions, 9279 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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-13 10:45:19,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:19,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:45:19,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:20,540 INFO L130 PetriNetUnfolder]: 1643/3469 cut-off events. [2022-12-13 10:45:20,540 INFO L131 PetriNetUnfolder]: For 172703/172703 co-relation queries the response was YES. [2022-12-13 10:45:20,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37450 conditions, 3469 events. 1643/3469 cut-off events. For 172703/172703 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27417 event pairs, 457 based on Foata normal form. 12/3481 useless extension candidates. Maximal degree in co-relation 36088. Up to 1685 conditions per place. [2022-12-13 10:45:20,572 INFO L137 encePairwiseOnDemand]: 18/46 looper letters, 320 selfloop transitions, 102 changer transitions 3/425 dead transitions. [2022-12-13 10:45:20,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 425 transitions, 11419 flow [2022-12-13 10:45:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:45:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:45:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-12-13 10:45:20,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1956521739130435 [2022-12-13 10:45:20,574 INFO L175 Difference]: Start difference. First operand has 183 places, 347 transitions, 9279 flow. Second operand 12 states and 108 transitions. [2022-12-13 10:45:20,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 425 transitions, 11419 flow [2022-12-13 10:45:21,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 425 transitions, 10997 flow, removed 209 selfloop flow, removed 4 redundant places. [2022-12-13 10:45:21,013 INFO L231 Difference]: Finished difference. Result has 193 places, 352 transitions, 9386 flow [2022-12-13 10:45:21,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8895, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9386, PETRI_PLACES=193, PETRI_TRANSITIONS=352} [2022-12-13 10:45:21,014 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 173 predicate places. [2022-12-13 10:45:21,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:21,014 INFO L89 Accepts]: Start accepts. Operand has 193 places, 352 transitions, 9386 flow [2022-12-13 10:45:21,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:21,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:21,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 352 transitions, 9386 flow [2022-12-13 10:45:21,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 352 transitions, 9386 flow [2022-12-13 10:45:21,180 INFO L130 PetriNetUnfolder]: 321/1336 cut-off events. [2022-12-13 10:45:21,181 INFO L131 PetriNetUnfolder]: For 52693/52696 co-relation queries the response was YES. [2022-12-13 10:45:21,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12722 conditions, 1336 events. 321/1336 cut-off events. For 52693/52696 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 13345 event pairs, 44 based on Foata normal form. 1/1328 useless extension candidates. Maximal degree in co-relation 11856. Up to 523 conditions per place. [2022-12-13 10:45:21,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 352 transitions, 9386 flow [2022-12-13 10:45:21,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-13 10:45:21,203 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:21,203 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:21,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] $Ultimate##0-->L51-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_188| 0)) (= v_~counter~0_460 (+ (* 3 v_~c~0_176) v_~counter~0_458)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_256|) 4294967296) (mod v_~N~0_169 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_256|) (= (ite (< 0 (mod (+ v_~counter~0_460 (* 4294967294 v_~c~0_176)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_188|) (not (= (ite (< 0 (mod v_~counter~0_460 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_188| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_188|) (not (= (ite (< 0 (mod (+ v_~counter~0_460 (* 4294967295 v_~c~0_176)) 4294967296)) 1 0) 0))) InVars {~counter~0=v_~counter~0_460, ~c~0=v_~c~0_176, ~N~0=v_~N~0_169} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_188|, ~counter~0=v_~counter~0_458, ~c~0=v_~c~0_176, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_196|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_188|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_256|, ~N~0=v_~N~0_169} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:21,580 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:45:21,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 566 [2022-12-13 10:45:21,581 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 352 transitions, 9408 flow [2022-12-13 10:45:21,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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-13 10:45:21,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:21,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:21,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 10:45:21,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 10:45:21,784 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1669858036, now seen corresponding path program 1 times [2022-12-13 10:45:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:21,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726114751] [2022-12-13 10:45:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:21,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726114751] [2022-12-13 10:45:21,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726114751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:21,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:21,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:45:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414781190] [2022-12-13 10:45:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:21,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:45:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:21,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:45:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:45:21,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:45:21,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 352 transitions, 9408 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:21,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:21,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:45:21,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:22,743 INFO L130 PetriNetUnfolder]: 1669/3547 cut-off events. [2022-12-13 10:45:22,743 INFO L131 PetriNetUnfolder]: For 177514/177514 co-relation queries the response was YES. [2022-12-13 10:45:22,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37957 conditions, 3547 events. 1669/3547 cut-off events. For 177514/177514 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 28317 event pairs, 453 based on Foata normal form. 24/3571 useless extension candidates. Maximal degree in co-relation 35658. Up to 2864 conditions per place. [2022-12-13 10:45:22,776 INFO L137 encePairwiseOnDemand]: 26/47 looper letters, 287 selfloop transitions, 82 changer transitions 15/384 dead transitions. [2022-12-13 10:45:22,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 384 transitions, 10768 flow [2022-12-13 10:45:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:45:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:45:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 10:45:22,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35638297872340424 [2022-12-13 10:45:22,777 INFO L175 Difference]: Start difference. First operand has 193 places, 352 transitions, 9408 flow. Second operand 4 states and 67 transitions. [2022-12-13 10:45:22,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 384 transitions, 10768 flow [2022-12-13 10:45:23,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 384 transitions, 10624 flow, removed 45 selfloop flow, removed 6 redundant places. [2022-12-13 10:45:23,282 INFO L231 Difference]: Finished difference. Result has 192 places, 355 transitions, 9661 flow [2022-12-13 10:45:23,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9268, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9661, PETRI_PLACES=192, PETRI_TRANSITIONS=355} [2022-12-13 10:45:23,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 172 predicate places. [2022-12-13 10:45:23,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:23,282 INFO L89 Accepts]: Start accepts. Operand has 192 places, 355 transitions, 9661 flow [2022-12-13 10:45:23,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:23,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:23,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 355 transitions, 9661 flow [2022-12-13 10:45:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 355 transitions, 9661 flow [2022-12-13 10:45:23,506 INFO L130 PetriNetUnfolder]: 323/1352 cut-off events. [2022-12-13 10:45:23,506 INFO L131 PetriNetUnfolder]: For 54437/54442 co-relation queries the response was YES. [2022-12-13 10:45:23,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13179 conditions, 1352 events. 323/1352 cut-off events. For 54437/54442 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 13571 event pairs, 46 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 12411. Up to 529 conditions per place. [2022-12-13 10:45:23,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 355 transitions, 9661 flow [2022-12-13 10:45:23,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 1222 [2022-12-13 10:45:23,532 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:23,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-13 10:45:23,532 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 355 transitions, 9661 flow [2022-12-13 10:45:23,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:23,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:23,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:23,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 10:45:23,533 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1815179708, now seen corresponding path program 1 times [2022-12-13 10:45:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:23,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094920412] [2022-12-13 10:45:23,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:23,584 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-13 10:45:23,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094920412] [2022-12-13 10:45:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094920412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274820449] [2022-12-13 10:45:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:23,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:23,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:23,587 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:23,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 10:45:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:23,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:45:23,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:23,688 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-13 10:45:23,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:23,706 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-13 10:45:23,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274820449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:23,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:23,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:45:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063930038] [2022-12-13 10:45:23,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:23,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:45:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:45:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:45:23,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:45:23,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 355 transitions, 9661 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-13 10:45:23,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:23,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:45:23,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:24,617 INFO L130 PetriNetUnfolder]: 1741/3663 cut-off events. [2022-12-13 10:45:24,618 INFO L131 PetriNetUnfolder]: For 200845/200845 co-relation queries the response was YES. [2022-12-13 10:45:24,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39811 conditions, 3663 events. 1741/3663 cut-off events. For 200845/200845 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 29474 event pairs, 766 based on Foata normal form. 46/3709 useless extension candidates. Maximal degree in co-relation 37322. Up to 3123 conditions per place. [2022-12-13 10:45:24,652 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 302 selfloop transitions, 105 changer transitions 0/407 dead transitions. [2022-12-13 10:45:24,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 407 transitions, 11495 flow [2022-12-13 10:45:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:45:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:45:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-13 10:45:24,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-13 10:45:24,653 INFO L175 Difference]: Start difference. First operand has 191 places, 355 transitions, 9661 flow. Second operand 6 states and 72 transitions. [2022-12-13 10:45:24,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 407 transitions, 11495 flow [2022-12-13 10:45:24,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 407 transitions, 11465 flow, removed 15 selfloop flow, removed 0 redundant places. [2022-12-13 10:45:24,977 INFO L231 Difference]: Finished difference. Result has 198 places, 373 transitions, 10613 flow [2022-12-13 10:45:24,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=9603, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10613, PETRI_PLACES=198, PETRI_TRANSITIONS=373} [2022-12-13 10:45:24,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 178 predicate places. [2022-12-13 10:45:24,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:24,977 INFO L89 Accepts]: Start accepts. Operand has 198 places, 373 transitions, 10613 flow [2022-12-13 10:45:24,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:24,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:24,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 373 transitions, 10613 flow [2022-12-13 10:45:24,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 373 transitions, 10613 flow [2022-12-13 10:45:25,165 INFO L130 PetriNetUnfolder]: 340/1405 cut-off events. [2022-12-13 10:45:25,165 INFO L131 PetriNetUnfolder]: For 63052/63052 co-relation queries the response was YES. [2022-12-13 10:45:25,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14184 conditions, 1405 events. 340/1405 cut-off events. For 63052/63052 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 14142 event pairs, 46 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 13294. Up to 561 conditions per place. [2022-12-13 10:45:25,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 373 transitions, 10613 flow [2022-12-13 10:45:25,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 1318 [2022-12-13 10:45:25,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:25,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 10:45:25,188 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 373 transitions, 10613 flow [2022-12-13 10:45:25,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-13 10:45:25,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:25,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:25,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:25,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 10:45:25,394 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -888283902, now seen corresponding path program 1 times [2022-12-13 10:45:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:25,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660738115] [2022-12-13 10:45:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:25,476 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-13 10:45:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660738115] [2022-12-13 10:45:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660738115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707909023] [2022-12-13 10:45:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:25,480 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 10:45:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:25,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:25,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:25,590 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-13 10:45:25,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:25,626 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-13 10:45:25,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707909023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:25,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:25,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:45:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029478968] [2022-12-13 10:45:25,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:25,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:45:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:45:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:45:25,628 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 10:45:25,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 373 transitions, 10613 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:25,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:25,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 10:45:25,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:26,725 INFO L130 PetriNetUnfolder]: 1810/3776 cut-off events. [2022-12-13 10:45:26,726 INFO L131 PetriNetUnfolder]: For 235666/235666 co-relation queries the response was YES. [2022-12-13 10:45:26,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42425 conditions, 3776 events. 1810/3776 cut-off events. For 235666/235666 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 30443 event pairs, 283 based on Foata normal form. 46/3822 useless extension candidates. Maximal degree in co-relation 40529. Up to 1781 conditions per place. [2022-12-13 10:45:26,762 INFO L137 encePairwiseOnDemand]: 19/44 looper letters, 299 selfloop transitions, 156 changer transitions 9/464 dead transitions. [2022-12-13 10:45:26,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 464 transitions, 13027 flow [2022-12-13 10:45:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:45:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:45:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-12-13 10:45:26,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1853146853146853 [2022-12-13 10:45:26,769 INFO L175 Difference]: Start difference. First operand has 198 places, 373 transitions, 10613 flow. Second operand 13 states and 106 transitions. [2022-12-13 10:45:26,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 464 transitions, 13027 flow [2022-12-13 10:45:27,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 464 transitions, 12876 flow, removed 72 selfloop flow, removed 1 redundant places. [2022-12-13 10:45:27,244 INFO L231 Difference]: Finished difference. Result has 214 places, 395 transitions, 11638 flow [2022-12-13 10:45:27,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=10400, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11638, PETRI_PLACES=214, PETRI_TRANSITIONS=395} [2022-12-13 10:45:27,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 194 predicate places. [2022-12-13 10:45:27,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:27,245 INFO L89 Accepts]: Start accepts. Operand has 214 places, 395 transitions, 11638 flow [2022-12-13 10:45:27,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:27,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:27,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 395 transitions, 11638 flow [2022-12-13 10:45:27,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 395 transitions, 11638 flow [2022-12-13 10:45:27,450 INFO L130 PetriNetUnfolder]: 357/1449 cut-off events. [2022-12-13 10:45:27,450 INFO L131 PetriNetUnfolder]: For 70618/70618 co-relation queries the response was YES. [2022-12-13 10:45:27,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15346 conditions, 1449 events. 357/1449 cut-off events. For 70618/70618 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 14660 event pairs, 46 based on Foata normal form. 0/1442 useless extension candidates. Maximal degree in co-relation 14845. Up to 583 conditions per place. [2022-12-13 10:45:27,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 395 transitions, 11638 flow [2022-12-13 10:45:27,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 1418 [2022-12-13 10:45:27,473 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:27,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-13 10:45:27,474 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 395 transitions, 11638 flow [2022-12-13 10:45:27,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:27,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:27,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:27,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 10:45:27,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 10:45:27,679 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash -726480085, now seen corresponding path program 1 times [2022-12-13 10:45:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:27,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271048650] [2022-12-13 10:45:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:27,748 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-13 10:45:27,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:27,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271048650] [2022-12-13 10:45:27,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271048650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:27,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222661013] [2022-12-13 10:45:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:27,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:27,752 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:27,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 10:45:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:27,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:27,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:27,855 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-13 10:45:27,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:27,897 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-13 10:45:27,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222661013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:27,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:27,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:45:27,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737292633] [2022-12-13 10:45:27,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:45:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:27,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:45:27,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:45:27,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 10:45:27,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 395 transitions, 11638 flow. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:27,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:27,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 10:45:27,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:28,896 INFO L130 PetriNetUnfolder]: 1837/3821 cut-off events. [2022-12-13 10:45:28,896 INFO L131 PetriNetUnfolder]: For 231334/231334 co-relation queries the response was YES. [2022-12-13 10:45:28,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44663 conditions, 3821 events. 1837/3821 cut-off events. For 231334/231334 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 30280 event pairs, 450 based on Foata normal form. 26/3847 useless extension candidates. Maximal degree in co-relation 43067. Up to 1773 conditions per place. [2022-12-13 10:45:28,936 INFO L137 encePairwiseOnDemand]: 17/42 looper letters, 348 selfloop transitions, 141 changer transitions 0/489 dead transitions. [2022-12-13 10:45:28,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 489 transitions, 14187 flow [2022-12-13 10:45:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:45:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:45:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-12-13 10:45:28,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22727272727272727 [2022-12-13 10:45:28,937 INFO L175 Difference]: Start difference. First operand has 214 places, 395 transitions, 11638 flow. Second operand 11 states and 105 transitions. [2022-12-13 10:45:28,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 489 transitions, 14187 flow [2022-12-13 10:45:29,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 489 transitions, 13473 flow, removed 301 selfloop flow, removed 6 redundant places. [2022-12-13 10:45:29,672 INFO L231 Difference]: Finished difference. Result has 220 places, 402 transitions, 11586 flow [2022-12-13 10:45:29,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10955, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11586, PETRI_PLACES=220, PETRI_TRANSITIONS=402} [2022-12-13 10:45:29,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 200 predicate places. [2022-12-13 10:45:29,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:29,673 INFO L89 Accepts]: Start accepts. Operand has 220 places, 402 transitions, 11586 flow [2022-12-13 10:45:29,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:29,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:29,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 402 transitions, 11586 flow [2022-12-13 10:45:29,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 402 transitions, 11586 flow [2022-12-13 10:45:29,878 INFO L130 PetriNetUnfolder]: 363/1466 cut-off events. [2022-12-13 10:45:29,878 INFO L131 PetriNetUnfolder]: For 69789/69789 co-relation queries the response was YES. [2022-12-13 10:45:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15242 conditions, 1466 events. 363/1466 cut-off events. For 69789/69789 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 14740 event pairs, 45 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 14831. Up to 538 conditions per place. [2022-12-13 10:45:29,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 402 transitions, 11586 flow [2022-12-13 10:45:29,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 10:45:29,901 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:29,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-13 10:45:29,901 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 402 transitions, 11586 flow [2022-12-13 10:45:29,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:29,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:29,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:29,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 10:45:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 10:45:30,103 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1919827549, now seen corresponding path program 1 times [2022-12-13 10:45:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362856306] [2022-12-13 10:45:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:30,172 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-13 10:45:30,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:30,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362856306] [2022-12-13 10:45:30,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362856306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:30,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473239828] [2022-12-13 10:45:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:30,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:30,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:30,176 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 10:45:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:30,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:45:30,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:30,288 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-13 10:45:30,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:45:30,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473239828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:30,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:45:30,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-13 10:45:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773939151] [2022-12-13 10:45:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:30,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:45:30,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:30,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:45:30,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:45:30,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 10:45:30,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 402 transitions, 11586 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-13 10:45:30,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:30,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 10:45:30,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:31,601 INFO L130 PetriNetUnfolder]: 2417/5152 cut-off events. [2022-12-13 10:45:31,601 INFO L131 PetriNetUnfolder]: For 342965/342965 co-relation queries the response was YES. [2022-12-13 10:45:31,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60829 conditions, 5152 events. 2417/5152 cut-off events. For 342965/342965 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 44127 event pairs, 599 based on Foata normal form. 137/5289 useless extension candidates. Maximal degree in co-relation 58742. Up to 2728 conditions per place. [2022-12-13 10:45:31,670 INFO L137 encePairwiseOnDemand]: 19/42 looper letters, 305 selfloop transitions, 179 changer transitions 53/537 dead transitions. [2022-12-13 10:45:31,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 537 transitions, 16115 flow [2022-12-13 10:45:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:45:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:45:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-13 10:45:31,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3380952380952381 [2022-12-13 10:45:31,672 INFO L175 Difference]: Start difference. First operand has 220 places, 402 transitions, 11586 flow. Second operand 5 states and 71 transitions. [2022-12-13 10:45:31,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 537 transitions, 16115 flow [2022-12-13 10:45:32,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 537 transitions, 15875 flow, removed 55 selfloop flow, removed 6 redundant places. [2022-12-13 10:45:32,437 INFO L231 Difference]: Finished difference. Result has 221 places, 455 transitions, 13753 flow [2022-12-13 10:45:32,437 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11290, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13753, PETRI_PLACES=221, PETRI_TRANSITIONS=455} [2022-12-13 10:45:32,438 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 201 predicate places. [2022-12-13 10:45:32,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:32,438 INFO L89 Accepts]: Start accepts. Operand has 221 places, 455 transitions, 13753 flow [2022-12-13 10:45:32,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:32,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:32,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 455 transitions, 13753 flow [2022-12-13 10:45:32,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 455 transitions, 13753 flow [2022-12-13 10:45:32,730 INFO L130 PetriNetUnfolder]: 444/1891 cut-off events. [2022-12-13 10:45:32,731 INFO L131 PetriNetUnfolder]: For 99186/99191 co-relation queries the response was YES. [2022-12-13 10:45:32,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20859 conditions, 1891 events. 444/1891 cut-off events. For 99186/99191 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 20313 event pairs, 70 based on Foata normal form. 1/1879 useless extension candidates. Maximal degree in co-relation 20056. Up to 697 conditions per place. [2022-12-13 10:45:32,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 455 transitions, 13753 flow [2022-12-13 10:45:32,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 1586 [2022-12-13 10:45:32,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] $Ultimate##0-->L41-4: Formula: (and (< (mod v_thread1Thread1of1ForFork0_~i~0_192 4294967296) (mod v_~N~0_145 4294967296)) (= (+ v_thread1Thread1of1ForFork0_~i~0_192 1) v_thread1Thread1of1ForFork0_~i~0_191) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_130| (ite (< 0 (mod v_~counter~0_359 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_189| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_130| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|) (= v_~counter~0_357 v_~counter~0_359) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130| 0))) InVars {~counter~0=v_~counter~0_359, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_192, ~N~0=v_~N~0_145} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|, ~counter~0=v_~counter~0_357, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_136|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_191, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_138|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_130|, ~N~0=v_~N~0_145, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_189|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:32,774 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:32,774 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:32,959 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:32,959 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:33,058 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:45:33,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 621 [2022-12-13 10:45:33,059 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 454 transitions, 13777 flow [2022-12-13 10:45:33,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-13 10:45:33,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:33,059 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:33,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:33,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:33,260 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:33,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash 480141662, now seen corresponding path program 1 times [2022-12-13 10:45:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:33,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728476759] [2022-12-13 10:45:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728476759] [2022-12-13 10:45:33,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728476759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846924298] [2022-12-13 10:45:33,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:33,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:33,322 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:33,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 10:45:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:33,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 10:45:33,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:33,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:33,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846924298] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:33,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:33,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2022-12-13 10:45:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115043428] [2022-12-13 10:45:33,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:33,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:45:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:33,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:45:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:45:33,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 10:45:33,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 454 transitions, 13777 flow. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-13 10:45:33,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:33,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 10:45:33,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:34,967 INFO L130 PetriNetUnfolder]: 2487/5273 cut-off events. [2022-12-13 10:45:34,967 INFO L131 PetriNetUnfolder]: For 370953/370953 co-relation queries the response was YES. [2022-12-13 10:45:35,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64297 conditions, 5273 events. 2487/5273 cut-off events. For 370953/370953 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 45262 event pairs, 1091 based on Foata normal form. 98/5371 useless extension candidates. Maximal degree in co-relation 62284. Up to 4278 conditions per place. [2022-12-13 10:45:35,030 INFO L137 encePairwiseOnDemand]: 22/42 looper letters, 385 selfloop transitions, 170 changer transitions 2/557 dead transitions. [2022-12-13 10:45:35,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 557 transitions, 17342 flow [2022-12-13 10:45:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:45:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:45:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-12-13 10:45:35,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20714285714285716 [2022-12-13 10:45:35,032 INFO L175 Difference]: Start difference. First operand has 218 places, 454 transitions, 13777 flow. Second operand 10 states and 87 transitions. [2022-12-13 10:45:35,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 557 transitions, 17342 flow [2022-12-13 10:45:35,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 557 transitions, 16984 flow, removed 162 selfloop flow, removed 4 redundant places. [2022-12-13 10:45:35,805 INFO L231 Difference]: Finished difference. Result has 230 places, 509 transitions, 15974 flow [2022-12-13 10:45:35,805 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13449, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15974, PETRI_PLACES=230, PETRI_TRANSITIONS=509} [2022-12-13 10:45:35,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 210 predicate places. [2022-12-13 10:45:35,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:35,806 INFO L89 Accepts]: Start accepts. Operand has 230 places, 509 transitions, 15974 flow [2022-12-13 10:45:35,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:35,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:35,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 509 transitions, 15974 flow [2022-12-13 10:45:35,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 509 transitions, 15974 flow [2022-12-13 10:45:36,305 INFO L130 PetriNetUnfolder]: 495/2054 cut-off events. [2022-12-13 10:45:36,305 INFO L131 PetriNetUnfolder]: For 127973/127973 co-relation queries the response was YES. [2022-12-13 10:45:36,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23645 conditions, 2054 events. 495/2054 cut-off events. For 127973/127973 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 22206 event pairs, 70 based on Foata normal form. 0/2041 useless extension candidates. Maximal degree in co-relation 22792. Up to 783 conditions per place. [2022-12-13 10:45:36,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 509 transitions, 15974 flow [2022-12-13 10:45:36,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 1850 [2022-12-13 10:45:36,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] $Ultimate##0-->L41-4: Formula: (and (= 5 v_thread1Thread1of1ForFork0_~i~0_273) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_214| (ite (< 0 (mod (+ v_~counter~0_514 v_~c~0_192) 4294967296)) 1 0)) (= v_~counter~0_512 (+ v_~counter~0_514 (* v_~c~0_192 4))) (= |v_thread2Thread1of1ForFork1_~i~1#1_294| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_214| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_214| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_214|) (< 4 (mod v_~N~0_187 4294967296))) InVars {~counter~0=v_~counter~0_514, ~c~0=v_~c~0_192, ~N~0=v_~N~0_187} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_214|, ~counter~0=v_~counter~0_512, ~c~0=v_~c~0_192, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_202|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_273, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_222|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_214|, ~N~0=v_~N~0_187, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_294|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:36,345 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:36,346 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:36,554 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [348] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| (ite (< 0 (mod (+ v_~counter~0_331 (* 4294967295 v_~c~0_144)) 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (= 5 v_thread1Thread1of1ForFork0_~i~0_179) (= |v_thread2Thread1of1ForFork1_~i~1#1_174| 1) (< 4 (mod v_~N~0_137 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|) (= v_~counter~0_331 (+ (* v_~c~0_144 4) v_~counter~0_333))) InVars {~counter~0=v_~counter~0_333, ~c~0=v_~c~0_144, ~N~0=v_~N~0_137} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, ~counter~0=v_~counter~0_331, ~c~0=v_~c~0_144, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_126|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_179, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|, ~N~0=v_~N~0_137, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_174|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:36,554 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:36,555 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:36,846 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:45:36,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1043 [2022-12-13 10:45:36,849 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 510 transitions, 16214 flow [2022-12-13 10:45:36,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-13 10:45:36,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:36,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:36,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:37,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:37,055 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash 387562168, now seen corresponding path program 1 times [2022-12-13 10:45:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:37,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221210451] [2022-12-13 10:45:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:37,154 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-13 10:45:37,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:37,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221210451] [2022-12-13 10:45:37,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221210451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:37,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208295994] [2022-12-13 10:45:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:37,160 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:37,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 10:45:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:37,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:45:37,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:37,263 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-13 10:45:37,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:37,296 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-13 10:45:37,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208295994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:37,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:37,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 10:45:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036405639] [2022-12-13 10:45:37,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:37,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:45:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:45:37,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:45:37,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:45:37,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 510 transitions, 16214 flow. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:37,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:37,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:45:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:39,026 INFO L130 PetriNetUnfolder]: 2481/5260 cut-off events. [2022-12-13 10:45:39,026 INFO L131 PetriNetUnfolder]: For 405091/405091 co-relation queries the response was YES. [2022-12-13 10:45:39,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67390 conditions, 5260 events. 2481/5260 cut-off events. For 405091/405091 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 45009 event pairs, 565 based on Foata normal form. 5/5263 useless extension candidates. Maximal degree in co-relation 65332. Up to 5179 conditions per place. [2022-12-13 10:45:39,084 INFO L137 encePairwiseOnDemand]: 16/46 looper letters, 483 selfloop transitions, 32 changer transitions 13/528 dead transitions. [2022-12-13 10:45:39,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 528 transitions, 17402 flow [2022-12-13 10:45:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:45:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:45:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-13 10:45:39,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 10:45:39,085 INFO L175 Difference]: Start difference. First operand has 229 places, 510 transitions, 16214 flow. Second operand 5 states and 69 transitions. [2022-12-13 10:45:39,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 528 transitions, 17402 flow [2022-12-13 10:45:40,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 528 transitions, 16831 flow, removed 280 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:40,034 INFO L231 Difference]: Finished difference. Result has 233 places, 505 transitions, 15524 flow [2022-12-13 10:45:40,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15559, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15524, PETRI_PLACES=233, PETRI_TRANSITIONS=505} [2022-12-13 10:45:40,035 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 213 predicate places. [2022-12-13 10:45:40,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:40,035 INFO L89 Accepts]: Start accepts. Operand has 233 places, 505 transitions, 15524 flow [2022-12-13 10:45:40,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:40,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:40,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 505 transitions, 15524 flow [2022-12-13 10:45:40,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 505 transitions, 15524 flow [2022-12-13 10:45:40,469 INFO L130 PetriNetUnfolder]: 494/2043 cut-off events. [2022-12-13 10:45:40,469 INFO L131 PetriNetUnfolder]: For 126146/126151 co-relation queries the response was YES. [2022-12-13 10:45:40,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23438 conditions, 2043 events. 494/2043 cut-off events. For 126146/126151 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 22010 event pairs, 70 based on Foata normal form. 1/2031 useless extension candidates. Maximal degree in co-relation 23323. Up to 770 conditions per place. [2022-12-13 10:45:40,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 505 transitions, 15524 flow [2022-12-13 10:45:40,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 1834 [2022-12-13 10:45:40,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] $Ultimate##0-->L41-4: Formula: (and (< 3 (mod v_~N~0_133 4294967296)) (= v_~counter~0_317 (+ v_~counter~0_319 (* v_~c~0_140 4))) (= v_thread1Thread1of1ForFork0_~i~0_172 4)) InVars {~counter~0=v_~counter~0_319, ~c~0=v_~c~0_140, ~N~0=v_~N~0_133} OutVars{~counter~0=v_~counter~0_317, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_119|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_172, ~N~0=v_~N~0_133} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [389] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_193 4294967296)) (.cse1 (+ v_~counter~0_545 v_~c~0_198))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_315|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_315|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_293 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231| 0)) (= v_thread1Thread1of1ForFork0_~i~0_292 (+ v_thread1Thread1of1ForFork0_~i~0_293 1)) (= v_~counter~0_547 .cse1))) InVars {~counter~0=v_~counter~0_547, ~c~0=v_~c~0_198, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_293, ~N~0=v_~N~0_193} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|, ~counter~0=v_~counter~0_545, ~c~0=v_~c~0_198, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_217|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_292, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_239|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_315|, ~N~0=v_~N~0_193} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:40,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] $Ultimate##0-->L41-4: Formula: (and (< 3 (mod v_~N~0_133 4294967296)) (= v_~counter~0_317 (+ v_~counter~0_319 (* v_~c~0_140 4))) (= v_thread1Thread1of1ForFork0_~i~0_172 4)) InVars {~counter~0=v_~counter~0_319, ~c~0=v_~c~0_140, ~N~0=v_~N~0_133} OutVars{~counter~0=v_~counter~0_317, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_119|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_172, ~N~0=v_~N~0_133} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [390] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_195 4294967296))) (and (= v_~counter~0_551 (+ v_~counter~0_553 v_~c~0_200)) (= |v_thread2Thread1of1ForFork1_~i~1#1_319| 1) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_296 (+ 2 v_thread1Thread1of1ForFork0_~i~0_298)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (< 0 (mod v_~counter~0_553 4294967296)) 1 0)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_298 1) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)))) InVars {~counter~0=v_~counter~0_553, ~c~0=v_~c~0_200, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_195} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, ~counter~0=v_~counter~0_551, ~c~0=v_~c~0_200, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_219|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_296, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_243|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, ~N~0=v_~N~0_195, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_319|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:40,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] $Ultimate##0-->L41-4: Formula: (and (< 3 (mod v_~N~0_133 4294967296)) (= v_~counter~0_317 (+ v_~counter~0_319 (* v_~c~0_140 4))) (= v_thread1Thread1of1ForFork0_~i~0_172 4)) InVars {~counter~0=v_~counter~0_319, ~c~0=v_~c~0_140, ~N~0=v_~N~0_133} OutVars{~counter~0=v_~counter~0_317, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_119|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_172, ~N~0=v_~N~0_133} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [369] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_165 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (< 1 .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_243|) (< (mod v_thread1Thread1of1ForFork0_~i~0_233 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_233 1) v_thread1Thread1of1ForFork0_~i~0_232) (= (+ v_~counter~0_438 v_~c~0_172) v_~counter~0_440) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176| 0)) (not (= (ite (< 0 (mod v_~counter~0_440 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| (ite (< 0 (mod v_~counter~0_438 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_440, ~c~0=v_~c~0_172, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_233, ~N~0=v_~N~0_165} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|, ~counter~0=v_~counter~0_438, ~c~0=v_~c~0_172, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_173|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_232, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_184|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176|, ~N~0=v_~N~0_165, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_243|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:40,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] $Ultimate##0-->L41-4: Formula: (and (< 3 (mod v_~N~0_133 4294967296)) (= v_~counter~0_317 (+ v_~counter~0_319 (* v_~c~0_140 4))) (= v_thread1Thread1of1ForFork0_~i~0_172 4)) InVars {~counter~0=v_~counter~0_319, ~c~0=v_~c~0_140, ~N~0=v_~N~0_133} OutVars{~counter~0=v_~counter~0_317, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_119|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_172, ~N~0=v_~N~0_133} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [386] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_189 4294967296))) (and (= v_~counter~0_523 (+ v_~counter~0_521 (* 3 v_~c~0_194))) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_299|) 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_280 1) v_thread1Thread1of1ForFork0_~i~0_279) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_218| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_299| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_218| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|) (not (= (ite (< 0 (mod v_~counter~0_523 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_523 (* 4294967294 v_~c~0_194)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_218| (ite (< 0 (mod (+ v_~counter~0_523 (* v_~c~0_194 4294967293)) 4294967296)) 1 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_523 (* 4294967295 v_~c~0_194)) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_280 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_523, ~c~0=v_~c~0_194, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_280, ~N~0=v_~N~0_189} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|, ~counter~0=v_~counter~0_521, ~c~0=v_~c~0_194, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_208|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_279, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_226|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_218|, ~N~0=v_~N~0_189, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_299|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:41,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] $Ultimate##0-->L41-4: Formula: (and (< 3 (mod v_~N~0_133 4294967296)) (= v_~counter~0_317 (+ v_~counter~0_319 (* v_~c~0_140 4))) (= v_thread1Thread1of1ForFork0_~i~0_172 4)) InVars {~counter~0=v_~counter~0_319, ~c~0=v_~c~0_140, ~N~0=v_~N~0_133} OutVars{~counter~0=v_~counter~0_317, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_119|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_172, ~N~0=v_~N~0_133} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [387] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_191 4294967296))) (and (= (+ v_thread1Thread1of1ForFork0_~i~0_284 1) v_thread1Thread1of1ForFork0_~i~0_283) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| (ite (< 0 (mod (+ v_~counter~0_529 (* 4294967294 v_~c~0_196)) 4294967296)) 1 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_529 (* 4294967295 v_~c~0_196)) 4294967296)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_222| 0)) (= v_~counter~0_529 (+ v_~counter~0_527 (* 2 v_~c~0_196))) (not (= (ite (< 0 (mod v_~counter~0_529 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_222|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_303|) (< (mod v_thread1Thread1of1ForFork0_~i~0_284 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_303|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_529, ~c~0=v_~c~0_196, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_284, ~N~0=v_~N~0_191} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_222|, ~counter~0=v_~counter~0_527, ~c~0=v_~c~0_196, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_210|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_283, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_230|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_222|, ~N~0=v_~N~0_191, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_303|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:41,440 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:41,441 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:41,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] $Ultimate##0-->L51-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137| 0)) (= v_~counter~0_368 (+ v_~counter~0_370 v_~c~0_154)) (not (= (ite (< 0 (mod (+ v_~counter~0_370 (* 3 v_~c~0_154)) 4294967296)) 1 0) 0)) (< 3 (mod v_~N~0_147 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_198|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| (ite (< 0 (mod (+ v_~counter~0_368 v_~c~0_154) 4294967296)) 1 0)) (= v_thread1Thread1of1ForFork0_~i~0_198 4)) InVars {~counter~0=v_~counter~0_370, ~c~0=v_~c~0_154, ~N~0=v_~N~0_147} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, ~counter~0=v_~counter~0_368, ~c~0=v_~c~0_154, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_141|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_198, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_145|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_198|, ~N~0=v_~N~0_147} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:41,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ (* 2 v_~c~0_226) v_~counter~0_640))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_271| (ite (< 0 (mod (+ v_~counter~0_640 v_~c~0_226) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_271| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|) (= 5 v_thread1Thread1of1ForFork0_~i~0_345) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_359|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271| 0)) (= .cse0 v_~counter~0_638) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_345) 4294967296) (mod v_~N~0_221 4294967296)))) InVars {~counter~0=v_~counter~0_640, ~c~0=v_~c~0_226, ~N~0=v_~N~0_221} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|, ~counter~0=v_~counter~0_638, ~c~0=v_~c~0_226, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_266|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_345, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_279|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_271|, ~N~0=v_~N~0_221, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_359|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:45:41,732 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:41,733 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:41,876 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:45:41,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1841 [2022-12-13 10:45:41,876 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 504 transitions, 15790 flow [2022-12-13 10:45:41,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:41,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:41,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:41,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:42,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-13 10:45:42,078 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash -204215341, now seen corresponding path program 1 times [2022-12-13 10:45:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:42,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682718867] [2022-12-13 10:45:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:42,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:42,178 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-13 10:45:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:42,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682718867] [2022-12-13 10:45:42,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682718867] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:42,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847217653] [2022-12-13 10:45:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:42,184 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:42,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 10:45:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:42,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:42,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:42,279 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-13 10:45:42,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:42,318 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-13 10:45:42,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847217653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:42,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:42,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:45:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334253033] [2022-12-13 10:45:42,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:42,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:45:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:45:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:45:42,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 10:45:42,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 504 transitions, 15790 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:42,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:42,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 10:45:42,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:44,276 INFO L130 PetriNetUnfolder]: 2708/5737 cut-off events. [2022-12-13 10:45:44,276 INFO L131 PetriNetUnfolder]: For 477778/477778 co-relation queries the response was YES. [2022-12-13 10:45:44,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75427 conditions, 5737 events. 2708/5737 cut-off events. For 477778/477778 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 49527 event pairs, 239 based on Foata normal form. 116/5849 useless extension candidates. Maximal degree in co-relation 75271. Up to 2475 conditions per place. [2022-12-13 10:45:44,348 INFO L137 encePairwiseOnDemand]: 13/44 looper letters, 245 selfloop transitions, 405 changer transitions 33/683 dead transitions. [2022-12-13 10:45:44,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 683 transitions, 22138 flow [2022-12-13 10:45:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:45:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:45:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2022-12-13 10:45:44,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17694805194805194 [2022-12-13 10:45:44,349 INFO L175 Difference]: Start difference. First operand has 229 places, 504 transitions, 15790 flow. Second operand 14 states and 109 transitions. [2022-12-13 10:45:44,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 683 transitions, 22138 flow [2022-12-13 10:45:45,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 683 transitions, 21882 flow, removed 82 selfloop flow, removed 4 redundant places. [2022-12-13 10:45:45,618 INFO L231 Difference]: Finished difference. Result has 244 places, 584 transitions, 19758 flow [2022-12-13 10:45:45,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14824, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=19758, PETRI_PLACES=244, PETRI_TRANSITIONS=584} [2022-12-13 10:45:45,619 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 224 predicate places. [2022-12-13 10:45:45,619 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:45,619 INFO L89 Accepts]: Start accepts. Operand has 244 places, 584 transitions, 19758 flow [2022-12-13 10:45:45,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:45,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:45,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 584 transitions, 19758 flow [2022-12-13 10:45:45,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 584 transitions, 19758 flow [2022-12-13 10:45:46,049 INFO L130 PetriNetUnfolder]: 504/2107 cut-off events. [2022-12-13 10:45:46,049 INFO L131 PetriNetUnfolder]: For 161737/161738 co-relation queries the response was YES. [2022-12-13 10:45:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27191 conditions, 2107 events. 504/2107 cut-off events. For 161737/161738 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 22908 event pairs, 24 based on Foata normal form. 1/2091 useless extension candidates. Maximal degree in co-relation 26573. Up to 852 conditions per place. [2022-12-13 10:45:46,087 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 584 transitions, 19758 flow [2022-12-13 10:45:46,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 2048 [2022-12-13 10:45:46,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_500 v_~c~0_186))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| (ite (< 0 (mod (+ v_~counter~0_498 v_~c~0_186) 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210| 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_498 (* 2 v_~c~0_186)) 4294967296)) 1 0) 0)) (= v_~counter~0_498 .cse0) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_261 4) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_261) 4294967296) (mod v_~N~0_179 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_284|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|))) InVars {~counter~0=v_~counter~0_500, ~c~0=v_~c~0_186, ~N~0=v_~N~0_179} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|, ~counter~0=v_~counter~0_498, ~c~0=v_~c~0_186, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_196|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_261, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_218|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_284|, ~N~0=v_~N~0_179} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:46,239 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:46,239 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:45:46,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_673 v_~c~0_236) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_365 4) (< 3 (mod v_~N~0_231 4294967296)) (not (= 0 (ite (< 0 (mod (+ v_~counter~0_673 (* 3 v_~c~0_236)) 4294967296)) 1 0))) (not (= (ite (< 0 (mod (+ v_~counter~0_673 (* 2 v_~c~0_236)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_287| .cse0) (= v_~counter~0_673 v_~counter~0_671) (= |v_thread2Thread1of1ForFork1_~i~1#1_376| 4) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_287| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|))) InVars {~counter~0=v_~counter~0_673, ~c~0=v_~c~0_236, ~N~0=v_~N~0_231} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|, ~counter~0=v_~counter~0_671, ~c~0=v_~c~0_236, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_286|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_365, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_295|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_376|, ~N~0=v_~N~0_231} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:46,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:46,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_673 v_~c~0_236) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_365 4) (< 3 (mod v_~N~0_231 4294967296)) (not (= 0 (ite (< 0 (mod (+ v_~counter~0_673 (* 3 v_~c~0_236)) 4294967296)) 1 0))) (not (= (ite (< 0 (mod (+ v_~counter~0_673 (* 2 v_~c~0_236)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_287| .cse0) (= v_~counter~0_673 v_~counter~0_671) (= |v_thread2Thread1of1ForFork1_~i~1#1_376| 4) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_287| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|))) InVars {~counter~0=v_~counter~0_673, ~c~0=v_~c~0_236, ~N~0=v_~N~0_231} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|, ~counter~0=v_~counter~0_671, ~c~0=v_~c~0_236, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_286|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_365, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_295|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_376|, ~N~0=v_~N~0_231} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:46,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 10:45:46,883 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 10:45:46,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1264 [2022-12-13 10:45:46,883 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 581 transitions, 19744 flow [2022-12-13 10:45:46,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:46,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:46,884 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:46,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 10:45:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:47,087 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1202921057, now seen corresponding path program 1 times [2022-12-13 10:45:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:47,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171042515] [2022-12-13 10:45:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:47,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:47,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171042515] [2022-12-13 10:45:47,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171042515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:47,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236219081] [2022-12-13 10:45:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:47,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:47,188 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:47,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 10:45:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:47,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:45:47,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:47,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:47,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236219081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:47,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:47,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 10:45:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108962237] [2022-12-13 10:45:47,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:47,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:45:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:45:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:45:47,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:45:47,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 581 transitions, 19744 flow. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:47,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:47,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:45:47,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:49,511 INFO L130 PetriNetUnfolder]: 2734/5791 cut-off events. [2022-12-13 10:45:49,511 INFO L131 PetriNetUnfolder]: For 564544/564544 co-relation queries the response was YES. [2022-12-13 10:45:49,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81658 conditions, 5791 events. 2734/5791 cut-off events. For 564544/564544 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 49711 event pairs, 598 based on Foata normal form. 29/5820 useless extension candidates. Maximal degree in co-relation 80236. Up to 3454 conditions per place. [2022-12-13 10:45:49,582 INFO L137 encePairwiseOnDemand]: 15/46 looper letters, 437 selfloop transitions, 198 changer transitions 29/664 dead transitions. [2022-12-13 10:45:49,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 664 transitions, 23452 flow [2022-12-13 10:45:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:45:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:45:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 10:45:49,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32608695652173914 [2022-12-13 10:45:49,583 INFO L175 Difference]: Start difference. First operand has 235 places, 581 transitions, 19744 flow. Second operand 5 states and 75 transitions. [2022-12-13 10:45:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 664 transitions, 23452 flow [2022-12-13 10:45:51,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 664 transitions, 22154 flow, removed 634 selfloop flow, removed 5 redundant places. [2022-12-13 10:45:51,550 INFO L231 Difference]: Finished difference. Result has 237 places, 597 transitions, 19965 flow [2022-12-13 10:45:51,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18640, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=19965, PETRI_PLACES=237, PETRI_TRANSITIONS=597} [2022-12-13 10:45:51,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 217 predicate places. [2022-12-13 10:45:51,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:51,552 INFO L89 Accepts]: Start accepts. Operand has 237 places, 597 transitions, 19965 flow [2022-12-13 10:45:51,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:51,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:51,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 597 transitions, 19965 flow [2022-12-13 10:45:51,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 597 transitions, 19965 flow [2022-12-13 10:45:52,113 INFO L130 PetriNetUnfolder]: 519/2188 cut-off events. [2022-12-13 10:45:52,113 INFO L131 PetriNetUnfolder]: For 154625/154626 co-relation queries the response was YES. [2022-12-13 10:45:52,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27366 conditions, 2188 events. 519/2188 cut-off events. For 154625/154626 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 24107 event pairs, 28 based on Foata normal form. 1/2171 useless extension candidates. Maximal degree in co-relation 26764. Up to 874 conditions per place. [2022-12-13 10:45:52,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 597 transitions, 19965 flow [2022-12-13 10:45:52,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-13 10:45:52,160 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:52,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 608 [2022-12-13 10:45:52,160 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 597 transitions, 19965 flow [2022-12-13 10:45:52,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:52,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:52,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:52,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 10:45:52,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:52,367 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1218118339, now seen corresponding path program 1 times [2022-12-13 10:45:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:52,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586314807] [2022-12-13 10:45:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:45:52,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:52,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586314807] [2022-12-13 10:45:52,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586314807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:45:52,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:45:52,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:45:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993397902] [2022-12-13 10:45:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:45:52,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:45:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:45:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:45:52,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:45:52,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 597 transitions, 19965 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:52,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:52,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:45:52,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:54,300 INFO L130 PetriNetUnfolder]: 2742/5805 cut-off events. [2022-12-13 10:45:54,300 INFO L131 PetriNetUnfolder]: For 531956/531956 co-relation queries the response was YES. [2022-12-13 10:45:54,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79492 conditions, 5805 events. 2742/5805 cut-off events. For 531956/531956 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 50019 event pairs, 1389 based on Foata normal form. 18/5823 useless extension candidates. Maximal degree in co-relation 77470. Up to 5681 conditions per place. [2022-12-13 10:45:54,531 INFO L137 encePairwiseOnDemand]: 38/45 looper letters, 589 selfloop transitions, 27 changer transitions 0/616 dead transitions. [2022-12-13 10:45:54,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 616 transitions, 21756 flow [2022-12-13 10:45:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:45:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:45:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 10:45:54,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2022-12-13 10:45:54,532 INFO L175 Difference]: Start difference. First operand has 235 places, 597 transitions, 19965 flow. Second operand 3 states and 52 transitions. [2022-12-13 10:45:54,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 616 transitions, 21756 flow [2022-12-13 10:45:56,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 616 transitions, 21620 flow, removed 68 selfloop flow, removed 2 redundant places. [2022-12-13 10:45:56,071 INFO L231 Difference]: Finished difference. Result has 236 places, 606 transitions, 20316 flow [2022-12-13 10:45:56,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=19847, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20316, PETRI_PLACES=236, PETRI_TRANSITIONS=606} [2022-12-13 10:45:56,071 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 216 predicate places. [2022-12-13 10:45:56,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:45:56,072 INFO L89 Accepts]: Start accepts. Operand has 236 places, 606 transitions, 20316 flow [2022-12-13 10:45:56,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:45:56,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:45:56,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 606 transitions, 20316 flow [2022-12-13 10:45:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 606 transitions, 20316 flow [2022-12-13 10:45:56,513 INFO L130 PetriNetUnfolder]: 528/2217 cut-off events. [2022-12-13 10:45:56,513 INFO L131 PetriNetUnfolder]: For 156584/156645 co-relation queries the response was YES. [2022-12-13 10:45:56,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27452 conditions, 2217 events. 528/2217 cut-off events. For 156584/156645 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 24455 event pairs, 28 based on Foata normal form. 0/2200 useless extension candidates. Maximal degree in co-relation 26626. Up to 882 conditions per place. [2022-12-13 10:45:56,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 606 transitions, 20316 flow [2022-12-13 10:45:56,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 2116 [2022-12-13 10:45:56,557 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:45:56,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-13 10:45:56,557 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 606 transitions, 20316 flow [2022-12-13 10:45:56,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:56,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:45:56,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:45:56,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 10:45:56,558 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:45:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:45:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1366172422, now seen corresponding path program 1 times [2022-12-13 10:45:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:45:56,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750786189] [2022-12-13 10:45:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:45:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:56,625 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-13 10:45:56,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:45:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750786189] [2022-12-13 10:45:56,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750786189] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:45:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33578846] [2022-12-13 10:45:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:45:56,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:45:56,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:45:56,632 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:45:56,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 10:45:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:45:56,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:45:56,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:45:56,724 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-13 10:45:56,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:45:56,752 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-13 10:45:56,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33578846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:45:56,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:45:56,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:45:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538163435] [2022-12-13 10:45:56,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:45:56,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:45:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:45:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:45:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:45:56,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:45:56,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 606 transitions, 20316 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:45:56,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:45:56,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:45:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:45:58,764 INFO L130 PetriNetUnfolder]: 2758/5829 cut-off events. [2022-12-13 10:45:58,764 INFO L131 PetriNetUnfolder]: For 547948/547948 co-relation queries the response was YES. [2022-12-13 10:45:58,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79540 conditions, 5829 events. 2758/5829 cut-off events. For 547948/547948 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 50352 event pairs, 1242 based on Foata normal form. 36/5865 useless extension candidates. Maximal degree in co-relation 78162. Up to 5314 conditions per place. [2022-12-13 10:45:58,943 INFO L137 encePairwiseOnDemand]: 16/45 looper letters, 520 selfloop transitions, 120 changer transitions 1/641 dead transitions. [2022-12-13 10:45:58,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 641 transitions, 22324 flow [2022-12-13 10:45:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:45:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:45:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 10:45:58,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24444444444444444 [2022-12-13 10:45:58,944 INFO L175 Difference]: Start difference. First operand has 236 places, 606 transitions, 20316 flow. Second operand 6 states and 66 transitions. [2022-12-13 10:45:58,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 641 transitions, 22324 flow [2022-12-13 10:46:00,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 641 transitions, 22209 flow, removed 44 selfloop flow, removed 1 redundant places. [2022-12-13 10:46:00,288 INFO L231 Difference]: Finished difference. Result has 241 places, 611 transitions, 20790 flow [2022-12-13 10:46:00,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20189, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20790, PETRI_PLACES=241, PETRI_TRANSITIONS=611} [2022-12-13 10:46:00,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 221 predicate places. [2022-12-13 10:46:00,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:00,289 INFO L89 Accepts]: Start accepts. Operand has 241 places, 611 transitions, 20790 flow [2022-12-13 10:46:00,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:00,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:00,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 611 transitions, 20790 flow [2022-12-13 10:46:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 611 transitions, 20790 flow [2022-12-13 10:46:00,735 INFO L130 PetriNetUnfolder]: 532/2224 cut-off events. [2022-12-13 10:46:00,735 INFO L131 PetriNetUnfolder]: For 164875/164936 co-relation queries the response was YES. [2022-12-13 10:46:00,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27887 conditions, 2224 events. 532/2224 cut-off events. For 164875/164936 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 24483 event pairs, 27 based on Foata normal form. 0/2211 useless extension candidates. Maximal degree in co-relation 27280. Up to 883 conditions per place. [2022-12-13 10:46:00,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 611 transitions, 20790 flow [2022-12-13 10:46:00,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 2134 [2022-12-13 10:46:00,776 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:00,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-13 10:46:00,777 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 611 transitions, 20790 flow [2022-12-13 10:46:00,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:00,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:00,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:00,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-13 10:46:00,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 10:46:00,978 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:00,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1761050318, now seen corresponding path program 1 times [2022-12-13 10:46:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:00,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675286196] [2022-12-13 10:46:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:01,053 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-13 10:46:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:01,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675286196] [2022-12-13 10:46:01,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675286196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:01,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876437274] [2022-12-13 10:46:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:01,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:01,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:01,055 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:01,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 10:46:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:01,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:46:01,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:01,175 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-13 10:46:01,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:01,205 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-13 10:46:01,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876437274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:01,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:01,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:46:01,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446014652] [2022-12-13 10:46:01,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:01,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:46:01,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:46:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:46:01,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:46:01,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 611 transitions, 20790 flow. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:01,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:01,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:46:01,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:03,572 INFO L130 PetriNetUnfolder]: 3000/6303 cut-off events. [2022-12-13 10:46:03,573 INFO L131 PetriNetUnfolder]: For 675677/675677 co-relation queries the response was YES. [2022-12-13 10:46:03,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86625 conditions, 6303 events. 3000/6303 cut-off events. For 675677/675677 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 54902 event pairs, 1022 based on Foata normal form. 160/6463 useless extension candidates. Maximal degree in co-relation 84218. Up to 4746 conditions per place. [2022-12-13 10:46:03,703 INFO L137 encePairwiseOnDemand]: 17/45 looper letters, 406 selfloop transitions, 333 changer transitions 14/753 dead transitions. [2022-12-13 10:46:03,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 753 transitions, 26089 flow [2022-12-13 10:46:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:46:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:46:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-12-13 10:46:03,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21555555555555556 [2022-12-13 10:46:03,705 INFO L175 Difference]: Start difference. First operand has 240 places, 611 transitions, 20790 flow. Second operand 10 states and 97 transitions. [2022-12-13 10:46:03,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 753 transitions, 26089 flow [2022-12-13 10:46:05,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 753 transitions, 25778 flow, removed 51 selfloop flow, removed 4 redundant places. [2022-12-13 10:46:05,207 INFO L231 Difference]: Finished difference. Result has 250 places, 683 transitions, 24209 flow [2022-12-13 10:46:05,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=20479, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24209, PETRI_PLACES=250, PETRI_TRANSITIONS=683} [2022-12-13 10:46:05,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 230 predicate places. [2022-12-13 10:46:05,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:05,208 INFO L89 Accepts]: Start accepts. Operand has 250 places, 683 transitions, 24209 flow [2022-12-13 10:46:05,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:05,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:05,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 683 transitions, 24209 flow [2022-12-13 10:46:05,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 683 transitions, 24209 flow [2022-12-13 10:46:05,730 INFO L130 PetriNetUnfolder]: 584/2412 cut-off events. [2022-12-13 10:46:05,730 INFO L131 PetriNetUnfolder]: For 196828/196889 co-relation queries the response was YES. [2022-12-13 10:46:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31443 conditions, 2412 events. 584/2412 cut-off events. For 196828/196889 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 26957 event pairs, 27 based on Foata normal form. 0/2399 useless extension candidates. Maximal degree in co-relation 30420. Up to 953 conditions per place. [2022-12-13 10:46:05,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 683 transitions, 24209 flow [2022-12-13 10:46:05,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 2394 [2022-12-13 10:46:05,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:46:05,896 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:46:05,896 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:46:06,069 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:46:06,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 862 [2022-12-13 10:46:06,070 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 683 transitions, 24262 flow [2022-12-13 10:46:06,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:06,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:06,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:06,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-13 10:46:06,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 10:46:06,271 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash -803738250, now seen corresponding path program 1 times [2022-12-13 10:46:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139385184] [2022-12-13 10:46:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:06,398 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-13 10:46:06,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:06,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139385184] [2022-12-13 10:46:06,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139385184] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:06,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29747071] [2022-12-13 10:46:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:06,400 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:06,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 10:46:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:06,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:46:06,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:06,530 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-13 10:46:06,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:06,571 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-13 10:46:06,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29747071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:06,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:06,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:46:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916678761] [2022-12-13 10:46:06,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:06,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:46:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:46:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:46:06,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:46:06,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 683 transitions, 24262 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:06,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:06,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:46:06,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:09,225 INFO L130 PetriNetUnfolder]: 3009/6308 cut-off events. [2022-12-13 10:46:09,225 INFO L131 PetriNetUnfolder]: For 787099/787099 co-relation queries the response was YES. [2022-12-13 10:46:09,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89433 conditions, 6308 events. 3009/6308 cut-off events. For 787099/787099 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 55034 event pairs, 573 based on Foata normal form. 246/6554 useless extension candidates. Maximal degree in co-relation 87566. Up to 2595 conditions per place. [2022-12-13 10:46:09,297 INFO L137 encePairwiseOnDemand]: 15/46 looper letters, 214 selfloop transitions, 549 changer transitions 16/779 dead transitions. [2022-12-13 10:46:09,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 779 transitions, 28694 flow [2022-12-13 10:46:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:46:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:46:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-13 10:46:09,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24456521739130435 [2022-12-13 10:46:09,298 INFO L175 Difference]: Start difference. First operand has 250 places, 683 transitions, 24262 flow. Second operand 8 states and 90 transitions. [2022-12-13 10:46:09,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 779 transitions, 28694 flow [2022-12-13 10:46:11,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 779 transitions, 26947 flow, removed 860 selfloop flow, removed 2 redundant places. [2022-12-13 10:46:11,642 INFO L231 Difference]: Finished difference. Result has 258 places, 723 transitions, 26249 flow [2022-12-13 10:46:11,643 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=22492, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=509, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=26249, PETRI_PLACES=258, PETRI_TRANSITIONS=723} [2022-12-13 10:46:11,643 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 238 predicate places. [2022-12-13 10:46:11,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:11,643 INFO L89 Accepts]: Start accepts. Operand has 258 places, 723 transitions, 26249 flow [2022-12-13 10:46:11,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:11,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:11,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 723 transitions, 26249 flow [2022-12-13 10:46:11,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 723 transitions, 26249 flow [2022-12-13 10:46:12,296 INFO L130 PetriNetUnfolder]: 592/2441 cut-off events. [2022-12-13 10:46:12,297 INFO L131 PetriNetUnfolder]: For 186645/186709 co-relation queries the response was YES. [2022-12-13 10:46:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31512 conditions, 2441 events. 592/2441 cut-off events. For 186645/186709 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 27434 event pairs, 30 based on Foata normal form. 0/2431 useless extension candidates. Maximal degree in co-relation 31157. Up to 829 conditions per place. [2022-12-13 10:46:12,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 723 transitions, 26249 flow [2022-12-13 10:46:12,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 2550 [2022-12-13 10:46:12,342 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:12,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 700 [2022-12-13 10:46:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 723 transitions, 26249 flow [2022-12-13 10:46:12,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:12,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:12,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:12,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 10:46:12,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 10:46:12,544 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -168473784, now seen corresponding path program 1 times [2022-12-13 10:46:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:12,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147497792] [2022-12-13 10:46:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:12,626 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-13 10:46:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:12,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147497792] [2022-12-13 10:46:12,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147497792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:12,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255485672] [2022-12-13 10:46:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:12,628 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:12,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 10:46:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:12,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:46:12,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:12,726 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-13 10:46:12,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:12,773 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-13 10:46:12,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255485672] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:12,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:12,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:46:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622005154] [2022-12-13 10:46:12,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:12,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:46:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:46:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:46:12,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:46:12,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 723 transitions, 26249 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:12,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:12,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:46:12,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:15,512 INFO L130 PetriNetUnfolder]: 3041/6369 cut-off events. [2022-12-13 10:46:15,512 INFO L131 PetriNetUnfolder]: For 667213/667213 co-relation queries the response was YES. [2022-12-13 10:46:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91445 conditions, 6369 events. 3041/6369 cut-off events. For 667213/667213 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 55861 event pairs, 510 based on Foata normal form. 20/6389 useless extension candidates. Maximal degree in co-relation 90377. Up to 3206 conditions per place. [2022-12-13 10:46:15,733 INFO L137 encePairwiseOnDemand]: 16/46 looper letters, 444 selfloop transitions, 352 changer transitions 11/807 dead transitions. [2022-12-13 10:46:15,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 807 transitions, 29579 flow [2022-12-13 10:46:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:46:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:46:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-12-13 10:46:15,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.191699604743083 [2022-12-13 10:46:15,734 INFO L175 Difference]: Start difference. First operand has 258 places, 723 transitions, 26249 flow. Second operand 11 states and 97 transitions. [2022-12-13 10:46:15,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 807 transitions, 29579 flow [2022-12-13 10:46:17,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 807 transitions, 28445 flow, removed 482 selfloop flow, removed 4 redundant places. [2022-12-13 10:46:17,835 INFO L231 Difference]: Finished difference. Result has 267 places, 737 transitions, 26656 flow [2022-12-13 10:46:17,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=25167, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=337, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=26656, PETRI_PLACES=267, PETRI_TRANSITIONS=737} [2022-12-13 10:46:17,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 247 predicate places. [2022-12-13 10:46:17,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:17,837 INFO L89 Accepts]: Start accepts. Operand has 267 places, 737 transitions, 26656 flow [2022-12-13 10:46:17,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:17,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:17,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 737 transitions, 26656 flow [2022-12-13 10:46:17,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 737 transitions, 26656 flow [2022-12-13 10:46:18,439 INFO L130 PetriNetUnfolder]: 600/2467 cut-off events. [2022-12-13 10:46:18,439 INFO L131 PetriNetUnfolder]: For 179539/179603 co-relation queries the response was YES. [2022-12-13 10:46:18,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31623 conditions, 2467 events. 600/2467 cut-off events. For 179539/179603 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 27775 event pairs, 30 based on Foata normal form. 0/2457 useless extension candidates. Maximal degree in co-relation 31260. Up to 843 conditions per place. [2022-12-13 10:46:18,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 737 transitions, 26656 flow [2022-12-13 10:46:18,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 2594 [2022-12-13 10:46:18,489 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:18,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 653 [2022-12-13 10:46:18,490 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 737 transitions, 26656 flow [2022-12-13 10:46:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:18,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:18,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:18,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-13 10:46:18,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 10:46:18,691 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 670498824, now seen corresponding path program 2 times [2022-12-13 10:46:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529060133] [2022-12-13 10:46:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:18,790 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-13 10:46:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:18,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529060133] [2022-12-13 10:46:18,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529060133] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:18,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089547037] [2022-12-13 10:46:18,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:46:18,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:18,796 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:18,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 10:46:18,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:46:18,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:46:18,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:46:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:18,917 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-13 10:46:18,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:18,954 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-13 10:46:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089547037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:18,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:18,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:46:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183522627] [2022-12-13 10:46:18,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:18,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:46:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:46:18,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:46:18,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:46:18,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 737 transitions, 26656 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-13 10:46:18,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:18,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:46:18,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:21,643 INFO L130 PetriNetUnfolder]: 3059/6396 cut-off events. [2022-12-13 10:46:21,643 INFO L131 PetriNetUnfolder]: For 604934/604934 co-relation queries the response was YES. [2022-12-13 10:46:21,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90969 conditions, 6396 events. 3059/6396 cut-off events. For 604934/604934 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 55838 event pairs, 219 based on Foata normal form. 8/6404 useless extension candidates. Maximal degree in co-relation 89887. Up to 2692 conditions per place. [2022-12-13 10:46:21,727 INFO L137 encePairwiseOnDemand]: 14/46 looper letters, 282 selfloop transitions, 527 changer transitions 16/825 dead transitions. [2022-12-13 10:46:21,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 825 transitions, 30708 flow [2022-12-13 10:46:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:46:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:46:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2022-12-13 10:46:21,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16304347826086957 [2022-12-13 10:46:21,729 INFO L175 Difference]: Start difference. First operand has 267 places, 737 transitions, 26656 flow. Second operand 14 states and 105 transitions. [2022-12-13 10:46:21,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 825 transitions, 30708 flow [2022-12-13 10:46:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 825 transitions, 29977 flow, removed 247 selfloop flow, removed 4 redundant places. [2022-12-13 10:46:23,843 INFO L231 Difference]: Finished difference. Result has 278 places, 747 transitions, 27751 flow [2022-12-13 10:46:23,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=25907, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=515, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=27751, PETRI_PLACES=278, PETRI_TRANSITIONS=747} [2022-12-13 10:46:23,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 258 predicate places. [2022-12-13 10:46:23,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:23,844 INFO L89 Accepts]: Start accepts. Operand has 278 places, 747 transitions, 27751 flow [2022-12-13 10:46:23,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:23,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:23,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 747 transitions, 27751 flow [2022-12-13 10:46:23,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 747 transitions, 27751 flow [2022-12-13 10:46:24,407 INFO L130 PetriNetUnfolder]: 602/2465 cut-off events. [2022-12-13 10:46:24,408 INFO L131 PetriNetUnfolder]: For 172030/172094 co-relation queries the response was YES. [2022-12-13 10:46:24,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32357 conditions, 2465 events. 602/2465 cut-off events. For 172030/172094 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 27685 event pairs, 27 based on Foata normal form. 0/2454 useless extension candidates. Maximal degree in co-relation 31992. Up to 838 conditions per place. [2022-12-13 10:46:24,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 747 transitions, 27751 flow [2022-12-13 10:46:24,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 2622 [2022-12-13 10:46:24,458 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:24,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 615 [2022-12-13 10:46:24,459 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 747 transitions, 27751 flow [2022-12-13 10:46:24,459 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-13 10:46:24,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:24,459 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:24,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 10:46:24,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:24,660 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1927374570, now seen corresponding path program 1 times [2022-12-13 10:46:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:24,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841618405] [2022-12-13 10:46:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:24,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:24,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841618405] [2022-12-13 10:46:24,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841618405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:24,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211961694] [2022-12-13 10:46:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:24,732 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:24,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 10:46:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:24,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:46:24,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:24,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:24,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211961694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:24,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:24,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 10:46:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894633149] [2022-12-13 10:46:24,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:24,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:46:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:24,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:46:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:46:24,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:46:24,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 747 transitions, 27751 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 10:46:24,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:24,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:46:24,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:27,603 INFO L130 PetriNetUnfolder]: 3250/6744 cut-off events. [2022-12-13 10:46:27,603 INFO L131 PetriNetUnfolder]: For 656173/656173 co-relation queries the response was YES. [2022-12-13 10:46:27,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96986 conditions, 6744 events. 3250/6744 cut-off events. For 656173/656173 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 58904 event pairs, 1068 based on Foata normal form. 58/6802 useless extension candidates. Maximal degree in co-relation 95905. Up to 4999 conditions per place. [2022-12-13 10:46:27,847 INFO L137 encePairwiseOnDemand]: 15/46 looper letters, 523 selfloop transitions, 342 changer transitions 6/871 dead transitions. [2022-12-13 10:46:27,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 871 transitions, 32807 flow [2022-12-13 10:46:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:46:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:46:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-12-13 10:46:27,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.191699604743083 [2022-12-13 10:46:27,849 INFO L175 Difference]: Start difference. First operand has 276 places, 747 transitions, 27751 flow. Second operand 11 states and 97 transitions. [2022-12-13 10:46:27,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 871 transitions, 32807 flow [2022-12-13 10:46:29,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 871 transitions, 32331 flow, removed 124 selfloop flow, removed 2 redundant places. [2022-12-13 10:46:29,929 INFO L231 Difference]: Finished difference. Result has 288 places, 804 transitions, 30630 flow [2022-12-13 10:46:29,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=27294, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=30630, PETRI_PLACES=288, PETRI_TRANSITIONS=804} [2022-12-13 10:46:29,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 268 predicate places. [2022-12-13 10:46:29,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:29,931 INFO L89 Accepts]: Start accepts. Operand has 288 places, 804 transitions, 30630 flow [2022-12-13 10:46:29,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:29,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:29,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 804 transitions, 30630 flow [2022-12-13 10:46:29,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 804 transitions, 30630 flow [2022-12-13 10:46:30,699 INFO L130 PetriNetUnfolder]: 642/2595 cut-off events. [2022-12-13 10:46:30,699 INFO L131 PetriNetUnfolder]: For 187129/187193 co-relation queries the response was YES. [2022-12-13 10:46:30,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34679 conditions, 2595 events. 642/2595 cut-off events. For 187129/187193 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 29329 event pairs, 27 based on Foata normal form. 0/2585 useless extension candidates. Maximal degree in co-relation 34295. Up to 899 conditions per place. [2022-12-13 10:46:30,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 804 transitions, 30630 flow [2022-12-13 10:46:30,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 2864 [2022-12-13 10:46:30,763 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:30,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 834 [2022-12-13 10:46:30,764 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 804 transitions, 30630 flow [2022-12-13 10:46:30,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 10:46:30,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:30,764 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:30,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-13 10:46:30,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-12-13 10:46:30,965 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 640641173, now seen corresponding path program 1 times [2022-12-13 10:46:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:30,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489503921] [2022-12-13 10:46:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:31,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489503921] [2022-12-13 10:46:31,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489503921] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:31,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991536585] [2022-12-13 10:46:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:31,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:31,036 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:31,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 10:46:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:31,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:46:31,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:31,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:31,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991536585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:31,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:31,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 10:46:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469395701] [2022-12-13 10:46:31,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:31,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:46:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:46:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:46:31,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:46:31,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 804 transitions, 30630 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:31,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:31,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:46:31,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:35,162 INFO L130 PetriNetUnfolder]: 4178/8791 cut-off events. [2022-12-13 10:46:35,162 INFO L131 PetriNetUnfolder]: For 965686/965686 co-relation queries the response was YES. [2022-12-13 10:46:35,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129633 conditions, 8791 events. 4178/8791 cut-off events. For 965686/965686 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 80297 event pairs, 404 based on Foata normal form. 182/8973 useless extension candidates. Maximal degree in co-relation 128494. Up to 3157 conditions per place. [2022-12-13 10:46:35,285 INFO L137 encePairwiseOnDemand]: 14/46 looper letters, 213 selfloop transitions, 845 changer transitions 51/1109 dead transitions. [2022-12-13 10:46:35,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1109 transitions, 42268 flow [2022-12-13 10:46:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:46:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:46:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 155 transitions. [2022-12-13 10:46:35,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2105978260869565 [2022-12-13 10:46:35,287 INFO L175 Difference]: Start difference. First operand has 288 places, 804 transitions, 30630 flow. Second operand 16 states and 155 transitions. [2022-12-13 10:46:35,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 1109 transitions, 42268 flow [2022-12-13 10:46:38,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1109 transitions, 41330 flow, removed 469 selfloop flow, removed 0 redundant places. [2022-12-13 10:46:38,916 INFO L231 Difference]: Finished difference. Result has 311 places, 973 transitions, 39538 flow [2022-12-13 10:46:38,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=29964, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=687, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=39538, PETRI_PLACES=311, PETRI_TRANSITIONS=973} [2022-12-13 10:46:38,917 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 291 predicate places. [2022-12-13 10:46:38,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:38,917 INFO L89 Accepts]: Start accepts. Operand has 311 places, 973 transitions, 39538 flow [2022-12-13 10:46:38,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:38,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:38,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 973 transitions, 39538 flow [2022-12-13 10:46:38,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 973 transitions, 39538 flow [2022-12-13 10:46:40,001 INFO L130 PetriNetUnfolder]: 805/3398 cut-off events. [2022-12-13 10:46:40,001 INFO L131 PetriNetUnfolder]: For 288996/289063 co-relation queries the response was YES. [2022-12-13 10:46:40,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48322 conditions, 3398 events. 805/3398 cut-off events. For 288996/289063 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 40612 event pairs, 34 based on Foata normal form. 0/3393 useless extension candidates. Maximal degree in co-relation 47914. Up to 1188 conditions per place. [2022-12-13 10:46:40,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 973 transitions, 39538 flow [2022-12-13 10:46:40,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 3514 [2022-12-13 10:46:40,089 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:40,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1172 [2022-12-13 10:46:40,089 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 973 transitions, 39538 flow [2022-12-13 10:46:40,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:40,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:40,090 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:40,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 10:46:40,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-13 10:46:40,295 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1500303212, now seen corresponding path program 1 times [2022-12-13 10:46:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707953488] [2022-12-13 10:46:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707953488] [2022-12-13 10:46:40,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707953488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888550375] [2022-12-13 10:46:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:40,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:40,417 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:40,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 10:46:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:40,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:46:40,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:40,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:40,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888550375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:40,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:40,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 10:46:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208100592] [2022-12-13 10:46:40,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:40,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:46:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:46:40,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:46:40,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:46:40,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 973 transitions, 39538 flow. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:40,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:40,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:46:40,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:46:47,391 INFO L130 PetriNetUnfolder]: 6110/12825 cut-off events. [2022-12-13 10:46:47,392 INFO L131 PetriNetUnfolder]: For 1576166/1576166 co-relation queries the response was YES. [2022-12-13 10:46:47,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206206 conditions, 12825 events. 6110/12825 cut-off events. For 1576166/1576166 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 123629 event pairs, 970 based on Foata normal form. 152/12977 useless extension candidates. Maximal degree in co-relation 205213. Up to 5402 conditions per place. [2022-12-13 10:46:47,579 INFO L137 encePairwiseOnDemand]: 15/45 looper letters, 696 selfloop transitions, 672 changer transitions 104/1472 dead transitions. [2022-12-13 10:46:47,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1472 transitions, 61335 flow [2022-12-13 10:46:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:46:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:46:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-13 10:46:47,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3074074074074074 [2022-12-13 10:46:47,581 INFO L175 Difference]: Start difference. First operand has 311 places, 973 transitions, 39538 flow. Second operand 6 states and 83 transitions. [2022-12-13 10:46:47,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1472 transitions, 61335 flow [2022-12-13 10:46:55,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 1472 transitions, 58609 flow, removed 1333 selfloop flow, removed 5 redundant places. [2022-12-13 10:46:55,314 INFO L231 Difference]: Finished difference. Result has 315 places, 1277 transitions, 53098 flow [2022-12-13 10:46:55,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=37760, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=53098, PETRI_PLACES=315, PETRI_TRANSITIONS=1277} [2022-12-13 10:46:55,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 295 predicate places. [2022-12-13 10:46:55,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:46:55,315 INFO L89 Accepts]: Start accepts. Operand has 315 places, 1277 transitions, 53098 flow [2022-12-13 10:46:55,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:46:55,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:46:55,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 1277 transitions, 53098 flow [2022-12-13 10:46:55,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 1277 transitions, 53098 flow [2022-12-13 10:46:56,978 INFO L130 PetriNetUnfolder]: 1120/4813 cut-off events. [2022-12-13 10:46:56,978 INFO L131 PetriNetUnfolder]: For 433414/433481 co-relation queries the response was YES. [2022-12-13 10:46:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69782 conditions, 4813 events. 1120/4813 cut-off events. For 433414/433481 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 61699 event pairs, 59 based on Foata normal form. 0/4800 useless extension candidates. Maximal degree in co-relation 69069. Up to 1670 conditions per place. [2022-12-13 10:46:57,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 1277 transitions, 53098 flow [2022-12-13 10:46:57,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 4690 [2022-12-13 10:46:57,110 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:46:57,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1796 [2022-12-13 10:46:57,111 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 1277 transitions, 53098 flow [2022-12-13 10:46:57,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:57,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:46:57,111 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:46:57,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-13 10:46:57,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 10:46:57,317 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:46:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:46:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2091992533, now seen corresponding path program 1 times [2022-12-13 10:46:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:46:57,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509303114] [2022-12-13 10:46:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:46:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:57,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:46:57,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509303114] [2022-12-13 10:46:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509303114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:46:57,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733630493] [2022-12-13 10:46:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:46:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:46:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:46:57,397 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:46:57,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 10:46:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:46:57,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:46:57,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:46:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:57,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:46:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:46:57,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733630493] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:46:57,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:46:57,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 10:46:57,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488759330] [2022-12-13 10:46:57,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:46:57,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:46:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:46:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:46:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:46:57,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:46:57,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 1277 transitions, 53098 flow. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:46:57,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:46:57,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:46:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:06,760 INFO L130 PetriNetUnfolder]: 6813/14221 cut-off events. [2022-12-13 10:47:06,760 INFO L131 PetriNetUnfolder]: For 1989259/1989259 co-relation queries the response was YES. [2022-12-13 10:47:06,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228368 conditions, 14221 events. 6813/14221 cut-off events. For 1989259/1989259 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 139763 event pairs, 2141 based on Foata normal form. 388/14609 useless extension candidates. Maximal degree in co-relation 224308. Up to 10275 conditions per place. [2022-12-13 10:47:06,980 INFO L137 encePairwiseOnDemand]: 11/45 looper letters, 852 selfloop transitions, 835 changer transitions 52/1739 dead transitions. [2022-12-13 10:47:06,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1739 transitions, 73092 flow [2022-12-13 10:47:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 10:47:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 10:47:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 170 transitions. [2022-12-13 10:47:06,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1642512077294686 [2022-12-13 10:47:06,982 INFO L175 Difference]: Start difference. First operand has 313 places, 1277 transitions, 53098 flow. Second operand 23 states and 170 transitions. [2022-12-13 10:47:06,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1739 transitions, 73092 flow [2022-12-13 10:47:14,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 1739 transitions, 71539 flow, removed 748 selfloop flow, removed 1 redundant places. [2022-12-13 10:47:14,484 INFO L231 Difference]: Finished difference. Result has 348 places, 1561 transitions, 67251 flow [2022-12-13 10:47:14,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=51992, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=606, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=67251, PETRI_PLACES=348, PETRI_TRANSITIONS=1561} [2022-12-13 10:47:14,485 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 328 predicate places. [2022-12-13 10:47:14,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:47:14,485 INFO L89 Accepts]: Start accepts. Operand has 348 places, 1561 transitions, 67251 flow [2022-12-13 10:47:14,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:47:14,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:47:14,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 348 places, 1561 transitions, 67251 flow [2022-12-13 10:47:14,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 348 places, 1561 transitions, 67251 flow [2022-12-13 10:47:16,751 INFO L130 PetriNetUnfolder]: 1330/5497 cut-off events. [2022-12-13 10:47:16,751 INFO L131 PetriNetUnfolder]: For 566396/566397 co-relation queries the response was YES. [2022-12-13 10:47:16,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82292 conditions, 5497 events. 1330/5497 cut-off events. For 566396/566397 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 71007 event pairs, 59 based on Foata normal form. 1/5487 useless extension candidates. Maximal degree in co-relation 81030. Up to 2034 conditions per place. [2022-12-13 10:47:16,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 348 places, 1561 transitions, 67251 flow [2022-12-13 10:47:16,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 5750 [2022-12-13 10:47:16,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_254| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_254|) (= v_~counter~0_584 (+ (* 5 v_~c~0_210) v_~counter~0_586)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_254| (ite (< 0 (mod (+ v_~counter~0_586 v_~c~0_210) 4294967296)) 1 0)) (= 6 v_thread1Thread1of1ForFork0_~i~0_311) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_254| 0)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_311) 4294967296) (mod v_~N~0_205 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_342| 1)) InVars {~counter~0=v_~counter~0_586, ~c~0=v_~c~0_210, ~N~0=v_~N~0_205} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_254|, ~counter~0=v_~counter~0_584, ~c~0=v_~c~0_210, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_232|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_311, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_262|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_254|, ~N~0=v_~N~0_205, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_342|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:47:16,889 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:47:16,889 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:47:17,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263|) (= v_~counter~0_608 (+ v_~counter~0_610 (* 5 v_~c~0_216))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (< 0 (mod (+ (* 4294967295 v_~c~0_216) v_~counter~0_608) 4294967296)) 1 0)) (= 6 v_thread1Thread1of1ForFork0_~i~0_325) (< 5 (mod v_~N~0_211 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_351| 1)) InVars {~counter~0=v_~counter~0_610, ~c~0=v_~c~0_216, ~N~0=v_~N~0_211} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263|, ~counter~0=v_~counter~0_608, ~c~0=v_~c~0_216, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_246|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_325, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_271|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, ~N~0=v_~N~0_211, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_351|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:47:17,007 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:47:17,007 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 10:47:17,203 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:47:17,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2719 [2022-12-13 10:47:17,204 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 1561 transitions, 67333 flow [2022-12-13 10:47:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:17,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:17,204 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:17,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-13 10:47:17,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:17,407 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:47:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash -214953999, now seen corresponding path program 2 times [2022-12-13 10:47:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:17,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341519768] [2022-12-13 10:47:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:17,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341519768] [2022-12-13 10:47:17,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341519768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:47:17,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123061462] [2022-12-13 10:47:17,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:47:17,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:47:17,484 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:47:17,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 10:47:17,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:47:17,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:47:17,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:47:17,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:47:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:17,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:47:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:17,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123061462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:47:17,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:47:17,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 10:47:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331294340] [2022-12-13 10:47:17,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:47:17,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:47:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:17,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:47:17,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:47:17,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:47:17,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 1561 transitions, 67333 flow. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-13 10:47:17,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:17,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:47:17,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:28,611 INFO L130 PetriNetUnfolder]: 6902/14246 cut-off events. [2022-12-13 10:47:28,611 INFO L131 PetriNetUnfolder]: For 2050414/2050414 co-relation queries the response was YES. [2022-12-13 10:47:28,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243272 conditions, 14246 events. 6902/14246 cut-off events. For 2050414/2050414 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 137436 event pairs, 272 based on Foata normal form. 84/14330 useless extension candidates. Maximal degree in co-relation 241112. Up to 5469 conditions per place. [2022-12-13 10:47:28,956 INFO L137 encePairwiseOnDemand]: 13/47 looper letters, 191 selfloop transitions, 1538 changer transitions 68/1797 dead transitions. [2022-12-13 10:47:28,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1797 transitions, 79191 flow [2022-12-13 10:47:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 10:47:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 10:47:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 147 transitions. [2022-12-13 10:47:28,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15638297872340426 [2022-12-13 10:47:28,958 INFO L175 Difference]: Start difference. First operand has 348 places, 1561 transitions, 67333 flow. Second operand 20 states and 147 transitions. [2022-12-13 10:47:28,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1797 transitions, 79191 flow [2022-12-13 10:47:40,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1797 transitions, 75230 flow, removed 1959 selfloop flow, removed 5 redundant places. [2022-12-13 10:47:40,516 INFO L231 Difference]: Finished difference. Result has 370 places, 1667 transitions, 73986 flow [2022-12-13 10:47:40,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=63076, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=73986, PETRI_PLACES=370, PETRI_TRANSITIONS=1667} [2022-12-13 10:47:40,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 350 predicate places. [2022-12-13 10:47:40,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:47:40,518 INFO L89 Accepts]: Start accepts. Operand has 370 places, 1667 transitions, 73986 flow [2022-12-13 10:47:40,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:47:40,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:47:40,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 1667 transitions, 73986 flow [2022-12-13 10:47:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 1667 transitions, 73986 flow [2022-12-13 10:47:42,744 INFO L130 PetriNetUnfolder]: 1332/5148 cut-off events. [2022-12-13 10:47:42,745 INFO L131 PetriNetUnfolder]: For 594354/594355 co-relation queries the response was YES. [2022-12-13 10:47:42,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82800 conditions, 5148 events. 1332/5148 cut-off events. For 594354/594355 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 63991 event pairs, 25 based on Foata normal form. 1/5135 useless extension candidates. Maximal degree in co-relation 81905. Up to 1955 conditions per place. [2022-12-13 10:47:42,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 1667 transitions, 73986 flow [2022-12-13 10:47:42,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 6054 [2022-12-13 10:47:42,885 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:47:42,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2367 [2022-12-13 10:47:42,885 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 1667 transitions, 73986 flow [2022-12-13 10:47:42,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-13 10:47:42,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:47:42,886 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:47:42,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-13 10:47:43,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:43,087 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:47:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:47:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2080704200, now seen corresponding path program 1 times [2022-12-13 10:47:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:47:43,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999664913] [2022-12-13 10:47:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:43,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:47:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:43,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:47:43,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999664913] [2022-12-13 10:47:43,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999664913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:47:43,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255238332] [2022-12-13 10:47:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:47:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:47:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:47:43,198 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:47:43,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 10:47:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:47:43,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:47:43,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:47:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:43,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:47:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:47:43,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255238332] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:47:43,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:47:43,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 10:47:43,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060561834] [2022-12-13 10:47:43,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:47:43,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:47:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:47:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:47:43,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:47:43,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:47:43,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1667 transitions, 73986 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:47:43,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:47:43,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:47:43,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:47:55,841 INFO L130 PetriNetUnfolder]: 7125/14312 cut-off events. [2022-12-13 10:47:55,842 INFO L131 PetriNetUnfolder]: For 2458308/2458308 co-relation queries the response was YES. [2022-12-13 10:47:56,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253027 conditions, 14312 events. 7125/14312 cut-off events. For 2458308/2458308 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 134421 event pairs, 2187 based on Foata normal form. 188/14500 useless extension candidates. Maximal degree in co-relation 249896. Up to 10905 conditions per place. [2022-12-13 10:47:56,098 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 1246 selfloop transitions, 694 changer transitions 6/1946 dead transitions. [2022-12-13 10:47:56,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1946 transitions, 87850 flow [2022-12-13 10:47:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:47:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:47:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 139 transitions. [2022-12-13 10:47:56,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16430260047281323 [2022-12-13 10:47:56,099 INFO L175 Difference]: Start difference. First operand has 367 places, 1667 transitions, 73986 flow. Second operand 18 states and 139 transitions. [2022-12-13 10:47:56,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1946 transitions, 87850 flow [2022-12-13 10:48:10,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 1946 transitions, 84887 flow, removed 1454 selfloop flow, removed 3 redundant places. [2022-12-13 10:48:10,916 INFO L231 Difference]: Finished difference. Result has 388 places, 1806 transitions, 80041 flow [2022-12-13 10:48:10,918 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=71683, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=574, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1032, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=80041, PETRI_PLACES=388, PETRI_TRANSITIONS=1806} [2022-12-13 10:48:10,918 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 368 predicate places. [2022-12-13 10:48:10,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:48:10,918 INFO L89 Accepts]: Start accepts. Operand has 388 places, 1806 transitions, 80041 flow [2022-12-13 10:48:10,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:48:10,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:48:10,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 1806 transitions, 80041 flow [2022-12-13 10:48:10,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 1806 transitions, 80041 flow [2022-12-13 10:48:13,391 INFO L130 PetriNetUnfolder]: 1436/5454 cut-off events. [2022-12-13 10:48:13,392 INFO L131 PetriNetUnfolder]: For 619525/619526 co-relation queries the response was YES. [2022-12-13 10:48:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86089 conditions, 5454 events. 1436/5454 cut-off events. For 619525/619526 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 67967 event pairs, 25 based on Foata normal form. 1/5442 useless extension candidates. Maximal degree in co-relation 85136. Up to 2082 conditions per place. [2022-12-13 10:48:13,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 388 places, 1806 transitions, 80041 flow [2022-12-13 10:48:13,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 6660 [2022-12-13 10:48:13,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:48:13,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:48:13,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:48:13,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2731 [2022-12-13 10:48:13,649 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 1806 transitions, 80053 flow [2022-12-13 10:48:13,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:48:13,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:48:13,649 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:48:13,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-13 10:48:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-13 10:48:13,850 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:48:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:48:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -339235013, now seen corresponding path program 3 times [2022-12-13 10:48:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:48:13,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125663097] [2022-12-13 10:48:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:48:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:48:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:48:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:48:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:48:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125663097] [2022-12-13 10:48:13,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125663097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:48:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236266544] [2022-12-13 10:48:13,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 10:48:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:48:13,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:48:13,924 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:48:13,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 10:48:14,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 10:48:14,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:48:14,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:48:14,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:48:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:48:14,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:48:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:48:14,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236266544] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:48:14,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:48:14,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 10:48:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509239754] [2022-12-13 10:48:14,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:48:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:48:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:48:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:48:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:48:14,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:48:14,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1806 transitions, 80053 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:48:14,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:48:14,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:48:14,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:48:27,519 INFO L130 PetriNetUnfolder]: 7612/15199 cut-off events. [2022-12-13 10:48:27,519 INFO L131 PetriNetUnfolder]: For 2604047/2604047 co-relation queries the response was YES. [2022-12-13 10:48:27,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264766 conditions, 15199 events. 7612/15199 cut-off events. For 2604047/2604047 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 142724 event pairs, 2075 based on Foata normal form. 310/15509 useless extension candidates. Maximal degree in co-relation 259904. Up to 10081 conditions per place. [2022-12-13 10:48:27,881 INFO L137 encePairwiseOnDemand]: 19/49 looper letters, 1025 selfloop transitions, 968 changer transitions 51/2044 dead transitions. [2022-12-13 10:48:27,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 2044 transitions, 93560 flow [2022-12-13 10:48:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:48:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:48:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 118 transitions. [2022-12-13 10:48:27,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17201166180758018 [2022-12-13 10:48:27,882 INFO L175 Difference]: Start difference. First operand has 388 places, 1806 transitions, 80053 flow. Second operand 14 states and 118 transitions. [2022-12-13 10:48:27,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 2044 transitions, 93560 flow [2022-12-13 10:48:42,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 2044 transitions, 90647 flow, removed 1426 selfloop flow, removed 2 redundant places. [2022-12-13 10:48:42,508 INFO L231 Difference]: Finished difference. Result has 406 places, 1948 transitions, 87548 flow [2022-12-13 10:48:42,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=77591, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=824, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=87548, PETRI_PLACES=406, PETRI_TRANSITIONS=1948} [2022-12-13 10:48:42,510 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 386 predicate places. [2022-12-13 10:48:42,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:48:42,510 INFO L89 Accepts]: Start accepts. Operand has 406 places, 1948 transitions, 87548 flow [2022-12-13 10:48:42,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:48:42,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:48:42,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 1948 transitions, 87548 flow [2022-12-13 10:48:42,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 406 places, 1948 transitions, 87548 flow [2022-12-13 10:48:45,048 INFO L130 PetriNetUnfolder]: 1532/5717 cut-off events. [2022-12-13 10:48:45,049 INFO L131 PetriNetUnfolder]: For 656063/656064 co-relation queries the response was YES. [2022-12-13 10:48:45,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91298 conditions, 5717 events. 1532/5717 cut-off events. For 656063/656064 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 70926 event pairs, 25 based on Foata normal form. 1/5705 useless extension candidates. Maximal degree in co-relation 90075. Up to 2252 conditions per place. [2022-12-13 10:48:45,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 1948 transitions, 87548 flow [2022-12-13 10:48:45,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 7168 [2022-12-13 10:48:45,224 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:48:45,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2715 [2022-12-13 10:48:45,225 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 1948 transitions, 87548 flow [2022-12-13 10:48:45,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:48:45,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:48:45,226 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:48:45,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-13 10:48:45,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-13 10:48:45,432 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:48:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:48:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1200623520, now seen corresponding path program 1 times [2022-12-13 10:48:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:48:45,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374277648] [2022-12-13 10:48:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:48:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:48:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:48:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:48:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:48:45,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374277648] [2022-12-13 10:48:45,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374277648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:48:45,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880806712] [2022-12-13 10:48:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:48:45,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:48:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:48:45,701 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:48:45,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 10:48:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:48:45,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:48:45,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:48:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:48:45,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:48:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:48:45,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880806712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:48:45,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:48:45,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 10:48:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597543866] [2022-12-13 10:48:45,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:48:45,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:48:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:48:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:48:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:48:45,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:48:45,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 1948 transitions, 87548 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:48:45,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:48:45,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:48:45,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:48:59,458 INFO L130 PetriNetUnfolder]: 7549/15068 cut-off events. [2022-12-13 10:48:59,458 INFO L131 PetriNetUnfolder]: For 2365998/2365998 co-relation queries the response was YES. [2022-12-13 10:48:59,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265299 conditions, 15068 events. 7549/15068 cut-off events. For 2365998/2365998 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 141077 event pairs, 1244 based on Foata normal form. 36/15104 useless extension candidates. Maximal degree in co-relation 262115. Up to 7859 conditions per place. [2022-12-13 10:48:59,738 INFO L137 encePairwiseOnDemand]: 13/49 looper letters, 1450 selfloop transitions, 712 changer transitions 3/2165 dead transitions. [2022-12-13 10:48:59,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 2165 transitions, 98833 flow [2022-12-13 10:48:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:48:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:48:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-13 10:48:59,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19047619047619047 [2022-12-13 10:48:59,739 INFO L175 Difference]: Start difference. First operand has 406 places, 1948 transitions, 87548 flow. Second operand 12 states and 112 transitions. [2022-12-13 10:48:59,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 2165 transitions, 98833 flow [2022-12-13 10:49:15,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 2165 transitions, 96468 flow, removed 1099 selfloop flow, removed 4 redundant places. [2022-12-13 10:49:15,777 INFO L231 Difference]: Finished difference. Result has 414 places, 1957 transitions, 87509 flow [2022-12-13 10:49:15,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=85281, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=703, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=87509, PETRI_PLACES=414, PETRI_TRANSITIONS=1957} [2022-12-13 10:49:15,779 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 394 predicate places. [2022-12-13 10:49:15,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:49:15,779 INFO L89 Accepts]: Start accepts. Operand has 414 places, 1957 transitions, 87509 flow [2022-12-13 10:49:15,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:49:15,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:49:15,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 414 places, 1957 transitions, 87509 flow [2022-12-13 10:49:15,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 414 places, 1957 transitions, 87509 flow [2022-12-13 10:49:18,799 INFO L130 PetriNetUnfolder]: 1540/5744 cut-off events. [2022-12-13 10:49:18,800 INFO L131 PetriNetUnfolder]: For 666339/666340 co-relation queries the response was YES. [2022-12-13 10:49:18,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91561 conditions, 5744 events. 1540/5744 cut-off events. For 666339/666340 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 71364 event pairs, 25 based on Foata normal form. 1/5732 useless extension candidates. Maximal degree in co-relation 90635. Up to 2171 conditions per place. [2022-12-13 10:49:19,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 414 places, 1957 transitions, 87509 flow [2022-12-13 10:49:19,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 7214 [2022-12-13 10:49:19,171 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:49:19,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3393 [2022-12-13 10:49:19,172 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 1957 transitions, 87509 flow [2022-12-13 10:49:19,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:49:19,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:49:19,172 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:49:19,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-13 10:49:19,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 10:49:19,378 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:49:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:49:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1722338816, now seen corresponding path program 1 times [2022-12-13 10:49:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:49:19,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735188652] [2022-12-13 10:49:19,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:49:19,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:49:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:49:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:49:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:49:19,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735188652] [2022-12-13 10:49:19,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735188652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:49:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688159860] [2022-12-13 10:49:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:49:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:49:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:49:19,643 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:49:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 10:49:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:49:19,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:49:19,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:49:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:49:19,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:49:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:49:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688159860] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:49:19,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:49:19,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-13 10:49:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003974633] [2022-12-13 10:49:19,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:49:19,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:49:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:49:19,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:49:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:49:19,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:49:19,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 1957 transitions, 87509 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:49:19,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:49:19,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:49:19,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:49:36,862 INFO L130 PetriNetUnfolder]: 8733/17651 cut-off events. [2022-12-13 10:49:36,862 INFO L131 PetriNetUnfolder]: For 3322538/3322538 co-relation queries the response was YES. [2022-12-13 10:49:37,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313414 conditions, 17651 events. 8733/17651 cut-off events. For 3322538/3322538 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 170407 event pairs, 488 based on Foata normal form. 252/17903 useless extension candidates. Maximal degree in co-relation 311194. Up to 6649 conditions per place. [2022-12-13 10:49:37,214 INFO L137 encePairwiseOnDemand]: 16/49 looper letters, 305 selfloop transitions, 2013 changer transitions 26/2344 dead transitions. [2022-12-13 10:49:37,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 2344 transitions, 105379 flow [2022-12-13 10:49:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 10:49:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 10:49:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 197 transitions. [2022-12-13 10:49:37,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18274582560296845 [2022-12-13 10:49:37,216 INFO L175 Difference]: Start difference. First operand has 414 places, 1957 transitions, 87509 flow. Second operand 22 states and 197 transitions. [2022-12-13 10:49:37,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 2344 transitions, 105379 flow [2022-12-13 10:49:54,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 2344 transitions, 103091 flow, removed 413 selfloop flow, removed 13 redundant places. [2022-12-13 10:49:54,963 INFO L231 Difference]: Finished difference. Result has 430 places, 2188 transitions, 100460 flow [2022-12-13 10:49:54,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=85314, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1795, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=100460, PETRI_PLACES=430, PETRI_TRANSITIONS=2188} [2022-12-13 10:49:54,965 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 410 predicate places. [2022-12-13 10:49:54,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:49:54,965 INFO L89 Accepts]: Start accepts. Operand has 430 places, 2188 transitions, 100460 flow [2022-12-13 10:49:54,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:49:54,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:49:54,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 2188 transitions, 100460 flow [2022-12-13 10:49:55,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 2188 transitions, 100460 flow [2022-12-13 10:49:58,601 INFO L130 PetriNetUnfolder]: 1751/6754 cut-off events. [2022-12-13 10:49:58,602 INFO L131 PetriNetUnfolder]: For 923845/923918 co-relation queries the response was YES. [2022-12-13 10:49:58,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111737 conditions, 6754 events. 1751/6754 cut-off events. For 923845/923918 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 86871 event pairs, 40 based on Foata normal form. 0/6749 useless extension candidates. Maximal degree in co-relation 109278. Up to 2528 conditions per place. [2022-12-13 10:49:58,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 2188 transitions, 100460 flow [2022-12-13 10:49:58,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 8100 [2022-12-13 10:49:58,845 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:49:58,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3881 [2022-12-13 10:49:58,846 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 2188 transitions, 100460 flow [2022-12-13 10:49:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:49:58,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:49:58,846 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:49:58,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-13 10:49:59,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:49:59,052 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:49:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:49:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash 900400461, now seen corresponding path program 1 times [2022-12-13 10:49:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:49:59,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89466014] [2022-12-13 10:49:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:49:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:49:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:49:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:49:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:49:59,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89466014] [2022-12-13 10:49:59,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89466014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:49:59,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934491911] [2022-12-13 10:49:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:49:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:49:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:49:59,176 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:49:59,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 10:49:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:49:59,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 10:49:59,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:49:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:49:59,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:49:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:49:59,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934491911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:49:59,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:49:59,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-12-13 10:49:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437053381] [2022-12-13 10:49:59,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:49:59,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:49:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:49:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:49:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:49:59,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:49:59,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 2188 transitions, 100460 flow. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:49:59,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:49:59,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:49:59,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:50:26,525 INFO L130 PetriNetUnfolder]: 12460/25265 cut-off events. [2022-12-13 10:50:26,525 INFO L131 PetriNetUnfolder]: For 5093878/5093878 co-relation queries the response was YES. [2022-12-13 10:50:27,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479732 conditions, 25265 events. 12460/25265 cut-off events. For 5093878/5093878 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 256764 event pairs, 1312 based on Foata normal form. 133/25398 useless extension candidates. Maximal degree in co-relation 466690. Up to 9611 conditions per place. [2022-12-13 10:50:27,238 INFO L137 encePairwiseOnDemand]: 17/49 looper letters, 1322 selfloop transitions, 1781 changer transitions 50/3153 dead transitions. [2022-12-13 10:50:27,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 3153 transitions, 150038 flow [2022-12-13 10:50:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:50:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:50:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-13 10:50:27,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27988338192419826 [2022-12-13 10:50:27,239 INFO L175 Difference]: Start difference. First operand has 430 places, 2188 transitions, 100460 flow. Second operand 7 states and 96 transitions. [2022-12-13 10:50:27,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 3153 transitions, 150038 flow [2022-12-13 10:51:01,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 3153 transitions, 144484 flow, removed 2614 selfloop flow, removed 6 redundant places. [2022-12-13 10:51:01,173 INFO L231 Difference]: Finished difference. Result has 435 places, 2915 transitions, 138843 flow [2022-12-13 10:51:01,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96918, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138843, PETRI_PLACES=435, PETRI_TRANSITIONS=2915} [2022-12-13 10:51:01,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 415 predicate places. [2022-12-13 10:51:01,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:51:01,175 INFO L89 Accepts]: Start accepts. Operand has 435 places, 2915 transitions, 138843 flow [2022-12-13 10:51:01,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:51:01,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:51:01,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 2915 transitions, 138843 flow [2022-12-13 10:51:01,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 2915 transitions, 138843 flow [2022-12-13 10:51:07,849 INFO L130 PetriNetUnfolder]: 2427/9497 cut-off events. [2022-12-13 10:51:07,850 INFO L131 PetriNetUnfolder]: For 1326580/1326581 co-relation queries the response was YES. [2022-12-13 10:51:08,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158564 conditions, 9497 events. 2427/9497 cut-off events. For 1326580/1326581 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 128877 event pairs, 74 based on Foata normal form. 1/9479 useless extension candidates. Maximal degree in co-relation 154895. Up to 3488 conditions per place. [2022-12-13 10:51:08,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 2915 transitions, 138843 flow [2022-12-13 10:51:08,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 11102 [2022-12-13 10:51:08,259 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:51:08,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7085 [2022-12-13 10:51:08,260 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 2915 transitions, 138843 flow [2022-12-13 10:51:08,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:51:08,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:51:08,260 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:51:08,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-13 10:51:08,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:51:08,465 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:51:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:51:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1119133513, now seen corresponding path program 1 times [2022-12-13 10:51:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:51:08,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391487264] [2022-12-13 10:51:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:51:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:51:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:51:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:51:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:51:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391487264] [2022-12-13 10:51:08,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391487264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:51:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754614265] [2022-12-13 10:51:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:51:08,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:51:08,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:51:08,708 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:51:08,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 10:51:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:51:08,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:51:08,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:51:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:51:08,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:51:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:51:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754614265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:51:08,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:51:08,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 10:51:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337417824] [2022-12-13 10:51:08,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:51:08,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:51:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:51:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:51:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:51:08,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:51:08,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 2915 transitions, 138843 flow. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:51:08,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:51:08,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:51:08,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:51:43,884 INFO L130 PetriNetUnfolder]: 12530/25386 cut-off events. [2022-12-13 10:51:43,885 INFO L131 PetriNetUnfolder]: For 5256581/5256581 co-relation queries the response was YES. [2022-12-13 10:51:44,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475842 conditions, 25386 events. 12530/25386 cut-off events. For 5256581/5256581 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 258447 event pairs, 4171 based on Foata normal form. 160/25546 useless extension candidates. Maximal degree in co-relation 462245. Up to 20032 conditions per place. [2022-12-13 10:51:44,406 INFO L137 encePairwiseOnDemand]: 16/49 looper letters, 2093 selfloop transitions, 1026 changer transitions 1/3120 dead transitions. [2022-12-13 10:51:44,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 3120 transitions, 152579 flow [2022-12-13 10:51:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:51:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:51:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2022-12-13 10:51:44,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19387755102040816 [2022-12-13 10:51:44,408 INFO L175 Difference]: Start difference. First operand has 435 places, 2915 transitions, 138843 flow. Second operand 10 states and 95 transitions. [2022-12-13 10:51:44,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 3120 transitions, 152579 flow [2022-12-13 10:52:18,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 3120 transitions, 150715 flow, removed 932 selfloop flow, removed 0 redundant places. [2022-12-13 10:52:18,117 INFO L231 Difference]: Finished difference. Result has 445 places, 2985 transitions, 143264 flow [2022-12-13 10:52:18,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=137193, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=956, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=143264, PETRI_PLACES=445, PETRI_TRANSITIONS=2985} [2022-12-13 10:52:18,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 425 predicate places. [2022-12-13 10:52:18,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:18,120 INFO L89 Accepts]: Start accepts. Operand has 445 places, 2985 transitions, 143264 flow [2022-12-13 10:52:18,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:18,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:18,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 445 places, 2985 transitions, 143264 flow [2022-12-13 10:52:18,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 445 places, 2985 transitions, 143264 flow [2022-12-13 10:52:25,246 INFO L130 PetriNetUnfolder]: 2479/9677 cut-off events. [2022-12-13 10:52:25,246 INFO L131 PetriNetUnfolder]: For 1361679/1361680 co-relation queries the response was YES. [2022-12-13 10:52:25,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160996 conditions, 9677 events. 2479/9677 cut-off events. For 1361679/1361680 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 131576 event pairs, 74 based on Foata normal form. 1/9658 useless extension candidates. Maximal degree in co-relation 157312. Up to 3590 conditions per place. [2022-12-13 10:52:25,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 445 places, 2985 transitions, 143264 flow [2022-12-13 10:52:25,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 11418 [2022-12-13 10:52:25,757 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:52:25,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7637 [2022-12-13 10:52:25,757 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 2985 transitions, 143264 flow [2022-12-13 10:52:25,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:25,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:25,758 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:25,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-13 10:52:25,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:25,962 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:52:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1689364557, now seen corresponding path program 1 times [2022-12-13 10:52:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:25,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090977953] [2022-12-13 10:52:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:26,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090977953] [2022-12-13 10:52:26,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090977953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:52:26,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320658395] [2022-12-13 10:52:26,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:26,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:26,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:26,047 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:52:26,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 10:52:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:26,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:52:26,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:52:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:26,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:52:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:26,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320658395] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:52:26,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:52:26,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 10:52:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003296118] [2022-12-13 10:52:26,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:52:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:52:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:52:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:52:26,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:52:26,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 2985 transitions, 143264 flow. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:26,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:26,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:52:26,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:28,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 10:53:08,275 INFO L130 PetriNetUnfolder]: 12707/25614 cut-off events. [2022-12-13 10:53:08,275 INFO L131 PetriNetUnfolder]: For 5154161/5154161 co-relation queries the response was YES. [2022-12-13 10:53:08,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488888 conditions, 25614 events. 12707/25614 cut-off events. For 5154161/5154161 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 259126 event pairs, 434 based on Foata normal form. 102/25716 useless extension candidates. Maximal degree in co-relation 475237. Up to 9617 conditions per place. [2022-12-13 10:53:08,916 INFO L137 encePairwiseOnDemand]: 14/49 looper letters, 242 selfloop transitions, 2925 changer transitions 42/3209 dead transitions. [2022-12-13 10:53:08,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 3209 transitions, 157906 flow [2022-12-13 10:53:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 10:53:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 10:53:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 160 transitions. [2022-12-13 10:53:08,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1419698314108252 [2022-12-13 10:53:08,917 INFO L175 Difference]: Start difference. First operand has 445 places, 2985 transitions, 143264 flow. Second operand 23 states and 160 transitions. [2022-12-13 10:53:08,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 3209 transitions, 157906 flow [2022-12-13 10:53:43,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 3209 transitions, 155915 flow, removed 653 selfloop flow, removed 3 redundant places. [2022-12-13 10:53:43,593 INFO L231 Difference]: Finished difference. Result has 474 places, 3094 transitions, 157181 flow [2022-12-13 10:53:43,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=141032, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2819, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=157181, PETRI_PLACES=474, PETRI_TRANSITIONS=3094} [2022-12-13 10:53:43,596 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 454 predicate places. [2022-12-13 10:53:43,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:43,597 INFO L89 Accepts]: Start accepts. Operand has 474 places, 3094 transitions, 157181 flow [2022-12-13 10:53:43,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:43,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:43,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 474 places, 3094 transitions, 157181 flow [2022-12-13 10:53:43,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 471 places, 3094 transitions, 157181 flow [2022-12-13 10:53:50,742 INFO L130 PetriNetUnfolder]: 2480/9490 cut-off events. [2022-12-13 10:53:50,743 INFO L131 PetriNetUnfolder]: For 1573897/1573898 co-relation queries the response was YES. [2022-12-13 10:53:50,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171247 conditions, 9490 events. 2480/9490 cut-off events. For 1573897/1573898 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 127808 event pairs, 33 based on Foata normal form. 1/9468 useless extension candidates. Maximal degree in co-relation 167368. Up to 3583 conditions per place. [2022-12-13 10:53:51,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 471 places, 3094 transitions, 157181 flow [2022-12-13 10:53:51,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 11724 [2022-12-13 10:53:51,099 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:53:51,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7504 [2022-12-13 10:53:51,100 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 3094 transitions, 157181 flow [2022-12-13 10:53:51,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:53:51,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:51,100 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:51,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-13 10:53:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-13 10:53:51,301 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:53:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1094179906, now seen corresponding path program 1 times [2022-12-13 10:53:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:51,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468613043] [2022-12-13 10:53:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:53:51,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:51,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468613043] [2022-12-13 10:53:51,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468613043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:53:51,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987160445] [2022-12-13 10:53:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:51,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:51,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:53:51,385 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:53:51,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 10:53:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:51,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 10:53:51,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:53:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:53:51,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:53:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:53:51,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987160445] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:53:51,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:53:51,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 10:53:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279253495] [2022-12-13 10:53:51,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:53:51,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:53:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:53:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:53:51,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:53:51,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 3094 transitions, 157181 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:53:51,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:51,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:53:51,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:54:35,475 INFO L130 PetriNetUnfolder]: 13204/26451 cut-off events. [2022-12-13 10:54:35,476 INFO L131 PetriNetUnfolder]: For 6410016/6410016 co-relation queries the response was YES. [2022-12-13 10:54:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528302 conditions, 26451 events. 13204/26451 cut-off events. For 6410016/6410016 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 267831 event pairs, 4141 based on Foata normal form. 180/26631 useless extension candidates. Maximal degree in co-relation 524137. Up to 20747 conditions per place. [2022-12-13 10:54:36,157 INFO L137 encePairwiseOnDemand]: 15/49 looper letters, 2317 selfloop transitions, 1120 changer transitions 17/3454 dead transitions. [2022-12-13 10:54:36,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 3454 transitions, 178489 flow [2022-12-13 10:54:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:54:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:54:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2022-12-13 10:54:36,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18738404452690166 [2022-12-13 10:54:36,158 INFO L175 Difference]: Start difference. First operand has 471 places, 3094 transitions, 157181 flow. Second operand 11 states and 101 transitions. [2022-12-13 10:54:36,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 3454 transitions, 178489 flow [2022-12-13 10:55:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 3454 transitions, 175040 flow, removed 1679 selfloop flow, removed 4 redundant places. [2022-12-13 10:55:35,591 INFO L231 Difference]: Finished difference. Result has 478 places, 3248 transitions, 164822 flow [2022-12-13 10:55:35,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=154532, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3094, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=956, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=164822, PETRI_PLACES=478, PETRI_TRANSITIONS=3248} [2022-12-13 10:55:35,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 458 predicate places. [2022-12-13 10:55:35,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:55:35,596 INFO L89 Accepts]: Start accepts. Operand has 478 places, 3248 transitions, 164822 flow [2022-12-13 10:55:35,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:55:35,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:55:35,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 3248 transitions, 164822 flow [2022-12-13 10:55:35,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 478 places, 3248 transitions, 164822 flow [2022-12-13 10:55:43,199 INFO L130 PetriNetUnfolder]: 2610/9920 cut-off events. [2022-12-13 10:55:43,199 INFO L131 PetriNetUnfolder]: For 1575991/1575992 co-relation queries the response was YES. [2022-12-13 10:55:43,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173238 conditions, 9920 events. 2610/9920 cut-off events. For 1575991/1575992 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 134351 event pairs, 33 based on Foata normal form. 1/9897 useless extension candidates. Maximal degree in co-relation 171471. Up to 3809 conditions per place. [2022-12-13 10:55:43,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 478 places, 3248 transitions, 164822 flow [2022-12-13 10:55:43,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 12376 [2022-12-13 10:55:43,534 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:55:43,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7939 [2022-12-13 10:55:43,534 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 3248 transitions, 164822 flow [2022-12-13 10:55:43,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:55:43,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:55:43,535 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:55:43,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-13 10:55:43,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-13 10:55:43,737 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:55:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:55:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 120696687, now seen corresponding path program 2 times [2022-12-13 10:55:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:55:43,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476551452] [2022-12-13 10:55:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:55:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:55:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:55:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:55:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:55:43,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476551452] [2022-12-13 10:55:43,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476551452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:55:43,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160922991] [2022-12-13 10:55:43,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:55:43,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:55:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:55:43,848 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:55:43,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 10:55:43,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:55:43,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:55:43,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:55:43,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:55:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:55:44,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:55:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:55:44,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160922991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:55:44,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:55:44,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 10:55:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071101691] [2022-12-13 10:55:44,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:55:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:55:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:55:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:55:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:55:44,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:55:44,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 3248 transitions, 164822 flow. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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-13 10:55:44,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:55:44,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:55:44,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:56:32,833 INFO L130 PetriNetUnfolder]: 14742/29205 cut-off events. [2022-12-13 10:56:32,834 INFO L131 PetriNetUnfolder]: For 6697434/6697434 co-relation queries the response was YES. [2022-12-13 10:56:33,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569497 conditions, 29205 events. 14742/29205 cut-off events. For 6697434/6697434 co-relation queries the response was YES. Maximal size of possible extension queue 2141. Compared 296903 event pairs, 2615 based on Foata normal form. 252/29457 useless extension candidates. Maximal degree in co-relation 565359. Up to 15875 conditions per place. [2022-12-13 10:56:33,767 INFO L137 encePairwiseOnDemand]: 14/49 looper letters, 2238 selfloop transitions, 1610 changer transitions 76/3924 dead transitions. [2022-12-13 10:56:33,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 3924 transitions, 201975 flow [2022-12-13 10:56:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 10:56:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 10:56:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 195 transitions. [2022-12-13 10:56:33,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1326530612244898 [2022-12-13 10:56:33,768 INFO L175 Difference]: Start difference. First operand has 478 places, 3248 transitions, 164822 flow. Second operand 30 states and 195 transitions. [2022-12-13 10:56:33,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 3924 transitions, 201975 flow [2022-12-13 10:57:35,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 3924 transitions, 199173 flow, removed 1000 selfloop flow, removed 4 redundant places. [2022-12-13 10:57:35,177 INFO L231 Difference]: Finished difference. Result has 516 places, 3630 transitions, 187696 flow [2022-12-13 10:57:35,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=162059, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=187696, PETRI_PLACES=516, PETRI_TRANSITIONS=3630} [2022-12-13 10:57:35,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 496 predicate places. [2022-12-13 10:57:35,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:57:35,179 INFO L89 Accepts]: Start accepts. Operand has 516 places, 3630 transitions, 187696 flow [2022-12-13 10:57:35,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:57:35,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:57:35,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 3630 transitions, 187696 flow [2022-12-13 10:57:35,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 514 places, 3630 transitions, 187696 flow [2022-12-13 10:57:44,737 INFO L130 PetriNetUnfolder]: 2945/10945 cut-off events. [2022-12-13 10:57:44,737 INFO L131 PetriNetUnfolder]: For 1629772/1629773 co-relation queries the response was YES. [2022-12-13 10:57:44,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192271 conditions, 10945 events. 2945/10945 cut-off events. For 1629772/1629773 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 149837 event pairs, 33 based on Foata normal form. 1/10924 useless extension candidates. Maximal degree in co-relation 190479. Up to 4372 conditions per place. [2022-12-13 10:57:45,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 514 places, 3630 transitions, 187696 flow [2022-12-13 10:57:45,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 13852 [2022-12-13 10:57:45,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:45,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:46,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, 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_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 10:57:46,117 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:57:46,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10938 [2022-12-13 10:57:46,117 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 3630 transitions, 187876 flow [2022-12-13 10:57:46,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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-13 10:57:46,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:46,118 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:46,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-13 10:57:46,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:57:46,323 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:57:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:46,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1234917653, now seen corresponding path program 1 times [2022-12-13 10:57:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:46,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179468235] [2022-12-13 10:57:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:46,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179468235] [2022-12-13 10:57:46,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179468235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:57:46,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062483333] [2022-12-13 10:57:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:57:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:57:46,416 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:57:46,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-13 10:57:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:46,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:57:46,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:57:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:46,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:57:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:46,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062483333] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:57:46,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:57:46,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 10:57:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718538644] [2022-12-13 10:57:46,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:57:46,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:57:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:57:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:57:46,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 10:57:46,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 3630 transitions, 187876 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:46,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:46,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 10:57:46,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 10:58:05,712 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:58:05,712 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:58:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 10:58:05,796 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 10:58:05,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-13 10:58:05,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-13 10:58:05,997 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/61 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 177503 conditions, 9544 events (5052/9543 cut-off events. For 1448088/1448088 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 94660 event pairs, 1441 based on Foata normal form. 62/11701 useless extension candidates. Maximal degree in co-relation 175208. Up to 5654 conditions per place.). [2022-12-13 10:58:05,998 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 10:58:05,998 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 10:58:05,998 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:58:06,002 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:58:06,002 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:58:06,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:58:06 BasicIcfg [2022-12-13 10:58:06,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:58:06,006 INFO L158 Benchmark]: Toolchain (without parser) took 805256.95ms. Allocated memory was 186.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 144.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-13 10:58:06,006 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory was 162.7MB in the beginning and 162.6MB in the end (delta: 79.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:58:06,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.61ms. Allocated memory is still 186.6MB. Free memory was 143.8MB in the beginning and 132.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 10:58:06,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.58ms. Allocated memory is still 186.6MB. Free memory was 132.8MB in the beginning and 131.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:58:06,007 INFO L158 Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 186.6MB. Free memory was 131.2MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 10:58:06,008 INFO L158 Benchmark]: RCFGBuilder took 396.41ms. Allocated memory is still 186.6MB. Free memory was 129.7MB in the beginning and 116.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 10:58:06,008 INFO L158 Benchmark]: TraceAbstraction took 804547.35ms. Allocated memory was 186.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 115.0MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-13 10:58:06,009 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.11ms. Allocated memory is still 186.6MB. Free memory was 162.7MB in the beginning and 162.6MB in the end (delta: 79.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.61ms. Allocated memory is still 186.6MB. Free memory was 143.8MB in the beginning and 132.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.58ms. Allocated memory is still 186.6MB. Free memory was 132.8MB in the beginning and 131.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.72ms. Allocated memory is still 186.6MB. Free memory was 131.2MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 396.41ms. Allocated memory is still 186.6MB. Free memory was 129.7MB in the beginning and 116.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 804547.35ms. Allocated memory was 186.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 115.0MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 266, unknown conditional: 266, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 270, Positive conditional cache size: 270, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 14, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 7, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 7, Positive cache size: 7, Positive conditional cache size: 7, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 7, Positive cache size: 7, Positive conditional cache size: 7, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 10, Positive conditional cache size: 10, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 40 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 23, Positive conditional cache size: 23, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 40 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 28, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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): 31, Positive cache size: 31, Positive conditional cache size: 31, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 31, Positive cache size: 31, Positive conditional cache size: 31, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 31, Positive cache size: 31, Positive conditional cache size: 31, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 35, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 35, Positive cache size: 35, Positive conditional cache size: 35, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 39, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 40, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 85 PlacesBefore, 78 PlacesAfterwards, 119 TransitionsBefore, 112 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 41, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 84, Positive conditional cache size: 84, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 77 PlacesBefore, 76 PlacesAfterwards, 116 TransitionsBefore, 115 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 89, Positive conditional cache size: 89, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 80 PlacesBefore, 80 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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): 92, Positive cache size: 92, Positive conditional cache size: 92, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 83 PlacesBefore, 83 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 93, Positive conditional cache size: 93, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 88 PlacesBefore, 88 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 98, Positive conditional cache size: 98, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 130 TransitionsBefore, 130 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 98, Positive cache size: 98, Positive conditional cache size: 98, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 98, Positive cache size: 98, Positive conditional cache size: 98, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 107 PlacesBefore, 107 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 100, Positive conditional cache size: 100, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 100, Positive cache size: 100, Positive conditional cache size: 100, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 126 PlacesBefore, 125 PlacesAfterwards, 201 TransitionsBefore, 200 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 139, Positive conditional cache size: 139, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 128 PlacesBefore, 128 PlacesAfterwards, 208 TransitionsBefore, 208 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 139, Positive cache size: 139, Positive conditional cache size: 139, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 136 PlacesBefore, 136 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 140, Positive cache size: 140, Positive conditional cache size: 140, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 139 PlacesBefore, 139 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 758 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 4, independent: 1, independent conditional: 1, 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): 143, Positive cache size: 143, Positive conditional cache size: 143, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 137 PlacesBefore, 137 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 144, Positive cache size: 144, Positive conditional cache size: 144, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 144, Positive cache size: 144, Positive conditional cache size: 144, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 145 PlacesBefore, 145 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 144, Positive cache size: 144, Positive conditional cache size: 144, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 149 PlacesBefore, 149 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 1, 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): 144, Positive cache size: 144, Positive conditional cache size: 144, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 151 PlacesBefore, 151 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 898 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 144, Positive cache size: 144, Positive conditional cache size: 144, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 168 PlacesBefore, 168 PlacesAfterwards, 320 TransitionsBefore, 320 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 145, Positive cache size: 145, Positive conditional cache size: 145, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 173 PlacesBefore, 172 PlacesAfterwards, 324 TransitionsBefore, 323 TransitionsAfterwards, 1116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 146, Positive cache size: 146, Positive conditional cache size: 146, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 186 PlacesBefore, 183 PlacesAfterwards, 350 TransitionsBefore, 347 TransitionsAfterwards, 1208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 154, Positive conditional cache size: 154, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 193 PlacesBefore, 193 PlacesAfterwards, 352 TransitionsBefore, 352 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 155, Positive conditional cache size: 155, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 191 PlacesBefore, 191 PlacesAfterwards, 355 TransitionsBefore, 355 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 155, Positive cache size: 155, Positive conditional cache size: 155, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 198 PlacesBefore, 198 PlacesAfterwards, 373 TransitionsBefore, 373 TransitionsAfterwards, 1318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 155, Positive cache size: 155, Positive conditional cache size: 155, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 214 PlacesBefore, 214 PlacesAfterwards, 395 TransitionsBefore, 395 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 155, Positive cache size: 155, Positive conditional cache size: 155, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 220 PlacesBefore, 220 PlacesAfterwards, 402 TransitionsBefore, 402 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 155, Positive cache size: 155, Positive conditional cache size: 155, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 219 PlacesBefore, 218 PlacesAfterwards, 455 TransitionsBefore, 454 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 198, Positive conditional cache size: 198, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 229 PlacesBefore, 229 PlacesAfterwards, 509 TransitionsBefore, 510 TransitionsAfterwards, 1850 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 200, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 230 PlacesBefore, 229 PlacesAfterwards, 505 TransitionsBefore, 504 TransitionsAfterwards, 1834 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 206, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 238 PlacesBefore, 235 PlacesAfterwards, 584 TransitionsBefore, 581 TransitionsAfterwards, 2048 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 210, Positive conditional cache size: 210, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 235 PlacesBefore, 235 PlacesAfterwards, 597 TransitionsBefore, 597 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 210, Positive cache size: 210, Positive conditional cache size: 210, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 236 PlacesBefore, 236 PlacesAfterwards, 606 TransitionsBefore, 606 TransitionsAfterwards, 2116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 210, Positive cache size: 210, Positive conditional cache size: 210, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 240 PlacesBefore, 240 PlacesAfterwards, 611 TransitionsBefore, 611 TransitionsAfterwards, 2134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 210, Positive cache size: 210, Positive conditional cache size: 210, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 250 PlacesBefore, 250 PlacesAfterwards, 683 TransitionsBefore, 683 TransitionsAfterwards, 2394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 258 PlacesBefore, 258 PlacesAfterwards, 723 TransitionsBefore, 723 TransitionsAfterwards, 2550 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 267 PlacesBefore, 267 PlacesAfterwards, 737 TransitionsBefore, 737 TransitionsAfterwards, 2594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 276 PlacesBefore, 276 PlacesAfterwards, 747 TransitionsBefore, 747 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 288 PlacesBefore, 288 PlacesAfterwards, 804 TransitionsBefore, 804 TransitionsAfterwards, 2864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 311 PlacesBefore, 311 PlacesAfterwards, 973 TransitionsBefore, 973 TransitionsAfterwards, 3514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 313 PlacesBefore, 313 PlacesAfterwards, 1277 TransitionsBefore, 1277 TransitionsAfterwards, 4690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 212, Positive cache size: 212, Positive conditional cache size: 212, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 348 PlacesBefore, 348 PlacesAfterwards, 1561 TransitionsBefore, 1561 TransitionsAfterwards, 5750 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 214, Positive conditional cache size: 214, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 367 PlacesBefore, 367 PlacesAfterwards, 1667 TransitionsBefore, 1667 TransitionsAfterwards, 6054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 214, Positive cache size: 214, Positive conditional cache size: 214, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 388 PlacesBefore, 388 PlacesAfterwards, 1806 TransitionsBefore, 1806 TransitionsAfterwards, 6660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 406 PlacesBefore, 406 PlacesAfterwards, 1948 TransitionsBefore, 1948 TransitionsAfterwards, 7168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 414 PlacesBefore, 414 PlacesAfterwards, 1957 TransitionsBefore, 1957 TransitionsAfterwards, 7214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 430 PlacesBefore, 430 PlacesAfterwards, 2188 TransitionsBefore, 2188 TransitionsAfterwards, 8100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 435 PlacesBefore, 435 PlacesAfterwards, 2915 TransitionsBefore, 2915 TransitionsAfterwards, 11102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 445 PlacesBefore, 445 PlacesAfterwards, 2985 TransitionsBefore, 2985 TransitionsAfterwards, 11418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 471 PlacesBefore, 471 PlacesAfterwards, 3094 TransitionsBefore, 3094 TransitionsAfterwards, 11724 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 478 PlacesBefore, 478 PlacesAfterwards, 3248 TransitionsBefore, 3248 TransitionsAfterwards, 12376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 215, Positive cache size: 215, Positive conditional cache size: 215, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 514 PlacesBefore, 514 PlacesAfterwards, 3630 TransitionsBefore, 3630 TransitionsAfterwards, 13852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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): 218, Positive cache size: 218, Positive conditional cache size: 218, 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 - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/61 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 177503 conditions, 9544 events (5052/9543 cut-off events. For 1448088/1448088 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 94660 event pairs, 1441 based on Foata normal form. 62/11701 useless extension candidates. Maximal degree in co-relation 175208. Up to 5654 conditions per place.). - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/61 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 177503 conditions, 9544 events (5052/9543 cut-off events. For 1448088/1448088 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 94660 event pairs, 1441 based on Foata normal form. 62/11701 useless extension candidates. Maximal degree in co-relation 175208. Up to 5654 conditions per place.). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/61 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 177503 conditions, 9544 events (5052/9543 cut-off events. For 1448088/1448088 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 94660 event pairs, 1441 based on Foata normal form. 62/11701 useless extension candidates. Maximal degree in co-relation 175208. Up to 5654 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 95 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 804.4s, OverallIterations: 66, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 693.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2968 SdHoareTripleChecker+Valid, 16.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2968 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 3077 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19370 IncrementalHoareTripleChecker+Invalid, 22448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3077 mSolverCounterUnsat, 6 mSDtfsCounter, 19370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1983 GetRequests, 1209 SyntacticMatches, 63 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187876occurred in iteration=65, InterpolantAutomatonStates: 585, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1643 NumberOfCodeBlocks, 1643 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2190 ConstructedInterpolants, 0 QuantifiedInterpolants, 12418 SizeOfPredicates, 130 NumberOfNonLiveVariables, 7041 ConjunctsInSsa, 516 ConjunctsInUnsatCore, 169 InterpolantComputations, 17 PerfectInterpolantSequences, 38/431 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown