/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:37:30,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:37:30,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:37:30,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:37:30,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:37:30,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:37:30,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:37:30,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:37:30,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:37:30,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:37:30,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:37:30,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:37:30,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:37:30,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:37:30,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:37:30,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:37:30,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:37:30,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:37:30,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:37:30,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:37:30,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:37:30,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:37:30,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:37:30,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:37:30,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:37:30,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:37:30,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:37:30,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:37:30,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:37:30,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:37:30,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:37:30,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:37:30,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:37:30,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:37:30,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:37:30,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:37:30,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:37:30,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:37:30,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:37:30,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:37:30,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:37:30,836 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:37:30,854 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:37:30,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:37:30,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:37:30,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:37:30,856 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:37:30,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:37:30,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:37:30,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:37:30,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:37:30,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:37:30,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:37:30,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:37:30,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:37:30,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:37:30,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:37:30,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:37:30,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:37:30,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:37:30,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:37:30,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:37:30,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:37:30,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:37:31,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:37:31,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:37:31,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:37:31,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:37:31,143 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:37:31,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2022-12-06 07:37:32,036 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:37:32,217 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:37:32,218 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2022-12-06 07:37:32,224 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4114e50/036ddacf82794113bd20d36a04532774/FLAGc67bc2aea [2022-12-06 07:37:32,232 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4114e50/036ddacf82794113bd20d36a04532774 [2022-12-06 07:37:32,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:37:32,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:37:32,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:37:32,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:37:32,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:37:32,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b363d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32, skipping insertion in model container [2022-12-06 07:37:32,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:37:32,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:37:32,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:32,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:32,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:32,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:32,381 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c[2681,2694] [2022-12-06 07:37:32,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:37:32,419 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:37:32,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:32,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:32,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:32,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:32,452 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c[2681,2694] [2022-12-06 07:37:32,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:37:32,465 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:37:32,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32 WrapperNode [2022-12-06 07:37:32,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:37:32,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:37:32,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:37:32,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:37:32,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,512 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 193 [2022-12-06 07:37:32,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:37:32,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:37:32,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:37:32,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:37:32,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:37:32,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:37:32,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:37:32,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:37:32,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (1/1) ... [2022-12-06 07:37:32,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:37:32,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:32,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:37:32,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:37:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:37:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:37:32,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:37:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:37:32,613 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:37:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:37:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:37:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:37:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:37:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:37:32,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:37:32,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:37:32,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:37:32,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:37:32,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:37:32,615 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:37:32,748 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:37:32,753 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:37:32,986 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:37:33,154 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:37:33,154 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:37:33,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:37:33 BoogieIcfgContainer [2022-12-06 07:37:33,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:37:33,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:37:33,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:37:33,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:37:33,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:37:32" (1/3) ... [2022-12-06 07:37:33,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f58368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:37:33, skipping insertion in model container [2022-12-06 07:37:33,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:32" (2/3) ... [2022-12-06 07:37:33,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f58368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:37:33, skipping insertion in model container [2022-12-06 07:37:33,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:37:33" (3/3) ... [2022-12-06 07:37:33,161 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2022-12-06 07:37:33,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:37:33,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:37:33,174 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:37:33,244 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:37:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 150 transitions, 316 flow [2022-12-06 07:37:33,350 INFO L130 PetriNetUnfolder]: 13/148 cut-off events. [2022-12-06 07:37:33,350 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:33,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 13/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 07:37:33,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 150 transitions, 316 flow [2022-12-06 07:37:33,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 140 transitions, 292 flow [2022-12-06 07:37:33,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:33,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 140 transitions, 292 flow [2022-12-06 07:37:33,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 292 flow [2022-12-06 07:37:33,428 INFO L130 PetriNetUnfolder]: 13/140 cut-off events. [2022-12-06 07:37:33,428 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:33,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 13/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 07:37:33,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 140 transitions, 292 flow [2022-12-06 07:37:33,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 07:37:38,697 INFO L203 LiptonReduction]: Total number of compositions: 121 [2022-12-06 07:37:38,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:37:38,711 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;@14aade60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:37:38,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:37:38,714 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 07:37:38,714 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:38,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:38,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:38,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 723377221, now seen corresponding path program 1 times [2022-12-06 07:37:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:38,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753184027] [2022-12-06 07:37:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:39,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753184027] [2022-12-06 07:37:39,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753184027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:39,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:39,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:37:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462632701] [2022-12-06 07:37:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:37:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:39,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:37:39,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:37:39,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 07:37:39,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:39,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 07:37:39,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:39,079 INFO L130 PetriNetUnfolder]: 67/118 cut-off events. [2022-12-06 07:37:39,079 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 07:37:39,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 118 events. 67/118 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 312 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2022-12-06 07:37:39,082 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2022-12-06 07:37:39,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 29 transitions, 133 flow [2022-12-06 07:37:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:37:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:37:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 07:37:39,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 07:37:39,091 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 34 transitions. [2022-12-06 07:37:39,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 29 transitions, 133 flow [2022-12-06 07:37:39,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:39,095 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2022-12-06 07:37:39,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2022-12-06 07:37:39,099 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-06 07:37:39,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:39,100 INFO L89 Accepts]: Start accepts. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 07:37:39,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:39,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:39,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 07:37:39,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 61 flow [2022-12-06 07:37:39,115 INFO L130 PetriNetUnfolder]: 9/33 cut-off events. [2022-12-06 07:37:39,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:37:39,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 9/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 07:37:39,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-06 07:37:39,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 07:37:39,117 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:39,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 07:37:39,119 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2022-12-06 07:37:39,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:39,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:39,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:37:39,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1532126613, now seen corresponding path program 1 times [2022-12-06 07:37:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984779715] [2022-12-06 07:37:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:39,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:39,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984779715] [2022-12-06 07:37:39,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984779715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:39,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:39,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610014111] [2022-12-06 07:37:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:39,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:39,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:37:39,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:39,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:37:39,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:39,341 INFO L130 PetriNetUnfolder]: 94/179 cut-off events. [2022-12-06 07:37:39,342 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 07:37:39,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 179 events. 94/179 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 572 event pairs, 26 based on Foata normal form. 4/181 useless extension candidates. Maximal degree in co-relation 144. Up to 88 conditions per place. [2022-12-06 07:37:39,344 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 34 selfloop transitions, 4 changer transitions 8/46 dead transitions. [2022-12-06 07:37:39,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 46 transitions, 223 flow [2022-12-06 07:37:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:37:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:37:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 07:37:39,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2022-12-06 07:37:39,347 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 43 transitions. [2022-12-06 07:37:39,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 46 transitions, 223 flow [2022-12-06 07:37:39,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 46 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:39,349 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 85 flow [2022-12-06 07:37:39,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2022-12-06 07:37:39,349 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-06 07:37:39,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:39,350 INFO L89 Accepts]: Start accepts. Operand has 27 places, 23 transitions, 85 flow [2022-12-06 07:37:39,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:39,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:39,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 23 transitions, 85 flow [2022-12-06 07:37:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 85 flow [2022-12-06 07:37:39,357 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-06 07:37:39,357 INFO L131 PetriNetUnfolder]: For 5/8 co-relation queries the response was YES. [2022-12-06 07:37:39,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 37 events. 8/37 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-06 07:37:39,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 85 flow [2022-12-06 07:37:39,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 07:37:39,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:39,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 07:37:39,577 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 83 flow [2022-12-06 07:37:39,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:39,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:39,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:37:39,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1490964483, now seen corresponding path program 1 times [2022-12-06 07:37:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:39,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762019404] [2022-12-06 07:37:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:39,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:39,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762019404] [2022-12-06 07:37:39,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762019404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:39,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:39,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875427385] [2022-12-06 07:37:39,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:39,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:39,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:37:39,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:39,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:37:39,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:39,695 INFO L130 PetriNetUnfolder]: 79/149 cut-off events. [2022-12-06 07:37:39,695 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-06 07:37:39,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 149 events. 79/149 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 427 event pairs, 23 based on Foata normal form. 6/153 useless extension candidates. Maximal degree in co-relation 323. Up to 72 conditions per place. [2022-12-06 07:37:39,697 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 34 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-06 07:37:39,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 38 transitions, 209 flow [2022-12-06 07:37:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:37:39,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 07:37:39,700 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 83 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:37:39,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 38 transitions, 209 flow [2022-12-06 07:37:39,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 188 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:39,702 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 94 flow [2022-12-06 07:37:39,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2022-12-06 07:37:39,703 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-06 07:37:39,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:39,704 INFO L89 Accepts]: Start accepts. Operand has 27 places, 24 transitions, 94 flow [2022-12-06 07:37:39,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:39,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:39,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 24 transitions, 94 flow [2022-12-06 07:37:39,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 94 flow [2022-12-06 07:37:39,710 INFO L130 PetriNetUnfolder]: 8/39 cut-off events. [2022-12-06 07:37:39,710 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:37:39,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 39 events. 8/39 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 44. Up to 12 conditions per place. [2022-12-06 07:37:39,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 94 flow [2022-12-06 07:37:39,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 07:37:39,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:39,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:37:39,805 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 88 flow [2022-12-06 07:37:39,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:39,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:39,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:37:39,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2133644839, now seen corresponding path program 1 times [2022-12-06 07:37:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:39,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607704934] [2022-12-06 07:37:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:39,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-06 07:37:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:39,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607704934] [2022-12-06 07:37:39,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607704934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:39,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:39,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846879075] [2022-12-06 07:37:39,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:39,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:39,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:37:39,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:39,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:37:39,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:39,960 INFO L130 PetriNetUnfolder]: 81/159 cut-off events. [2022-12-06 07:37:39,961 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-06 07:37:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 159 events. 81/159 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 31 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 181. Up to 113 conditions per place. [2022-12-06 07:37:39,962 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 34 selfloop transitions, 4 changer transitions 3/41 dead transitions. [2022-12-06 07:37:39,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 232 flow [2022-12-06 07:37:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 07:37:39,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-06 07:37:39,964 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 88 flow. Second operand 4 states and 42 transitions. [2022-12-06 07:37:39,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 232 flow [2022-12-06 07:37:39,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 215 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:37:39,967 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 105 flow [2022-12-06 07:37:39,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-06 07:37:39,969 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2022-12-06 07:37:39,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:39,969 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 105 flow [2022-12-06 07:37:39,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:39,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:39,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 105 flow [2022-12-06 07:37:39,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 105 flow [2022-12-06 07:37:39,976 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-06 07:37:39,976 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-06 07:37:39,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 50 events. 11/50 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 67. Up to 16 conditions per place. [2022-12-06 07:37:39,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 105 flow [2022-12-06 07:37:39,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 07:37:40,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:40,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:37:40,069 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 110 flow [2022-12-06 07:37:40,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:40,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:40,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:40,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:37:40,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 15125948, now seen corresponding path program 1 times [2022-12-06 07:37:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:40,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798825989] [2022-12-06 07:37:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:40,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798825989] [2022-12-06 07:37:40,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798825989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:40,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:40,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:37:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44336305] [2022-12-06 07:37:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:40,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:40,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:37:40,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:40,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:40,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:37:40,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:40,213 INFO L130 PetriNetUnfolder]: 81/175 cut-off events. [2022-12-06 07:37:40,213 INFO L131 PetriNetUnfolder]: For 256/264 co-relation queries the response was YES. [2022-12-06 07:37:40,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 175 events. 81/175 cut-off events. For 256/264 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 560 event pairs, 44 based on Foata normal form. 9/179 useless extension candidates. Maximal degree in co-relation 258. Up to 148 conditions per place. [2022-12-06 07:37:40,214 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 23 selfloop transitions, 2 changer transitions 12/38 dead transitions. [2022-12-06 07:37:40,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 222 flow [2022-12-06 07:37:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:37:40,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2022-12-06 07:37:40,215 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 110 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:37:40,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 222 flow [2022-12-06 07:37:40,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:40,216 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 120 flow [2022-12-06 07:37:40,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 07:37:40,217 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-06 07:37:40,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:40,217 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 120 flow [2022-12-06 07:37:40,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:40,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:40,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 120 flow [2022-12-06 07:37:40,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 120 flow [2022-12-06 07:37:40,222 INFO L130 PetriNetUnfolder]: 11/51 cut-off events. [2022-12-06 07:37:40,222 INFO L131 PetriNetUnfolder]: For 39/43 co-relation queries the response was YES. [2022-12-06 07:37:40,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 51 events. 11/51 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 1 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 101. Up to 16 conditions per place. [2022-12-06 07:37:40,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 120 flow [2022-12-06 07:37:40,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 07:37:41,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:41,021 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 804 [2022-12-06 07:37:41,021 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 116 flow [2022-12-06 07:37:41,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:41,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:41,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:37:41,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1341936530, now seen corresponding path program 1 times [2022-12-06 07:37:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:41,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971382215] [2022-12-06 07:37:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971382215] [2022-12-06 07:37:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971382215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:37:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189357639] [2022-12-06 07:37:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:41,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:37:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:37:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:37:41,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:37:41,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:41,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:37:41,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:41,101 INFO L130 PetriNetUnfolder]: 65/128 cut-off events. [2022-12-06 07:37:41,101 INFO L131 PetriNetUnfolder]: For 152/156 co-relation queries the response was YES. [2022-12-06 07:37:41,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 128 events. 65/128 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 346 event pairs, 17 based on Foata normal form. 5/130 useless extension candidates. Maximal degree in co-relation 389. Up to 100 conditions per place. [2022-12-06 07:37:41,102 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 24 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2022-12-06 07:37:41,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 199 flow [2022-12-06 07:37:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:37:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:37:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 07:37:41,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 07:37:41,103 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 116 flow. Second operand 3 states and 33 transitions. [2022-12-06 07:37:41,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 199 flow [2022-12-06 07:37:41,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 187 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:41,105 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 102 flow [2022-12-06 07:37:41,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 07:37:41,107 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 07:37:41,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:41,107 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 102 flow [2022-12-06 07:37:41,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:41,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:41,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 102 flow [2022-12-06 07:37:41,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 102 flow [2022-12-06 07:37:41,111 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2022-12-06 07:37:41,111 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 07:37:41,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 35 events. 9/35 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2022-12-06 07:37:41,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 102 flow [2022-12-06 07:37:41,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 07:37:41,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:41,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:37:41,113 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 102 flow [2022-12-06 07:37:41,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:41,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:41,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:37:41,113 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1896862322, now seen corresponding path program 1 times [2022-12-06 07:37:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:41,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710611569] [2022-12-06 07:37:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:41,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710611569] [2022-12-06 07:37:41,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710611569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:41,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:41,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:41,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374248141] [2022-12-06 07:37:41,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:41,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:41,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:41,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:41,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:37:41,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:41,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:37:41,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:41,189 INFO L130 PetriNetUnfolder]: 54/99 cut-off events. [2022-12-06 07:37:41,190 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-06 07:37:41,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 99 events. 54/99 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 204 event pairs, 20 based on Foata normal form. 6/103 useless extension candidates. Maximal degree in co-relation 190. Up to 84 conditions per place. [2022-12-06 07:37:41,190 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-06 07:37:41,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 189 flow [2022-12-06 07:37:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 07:37:41,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 07:37:41,191 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 102 flow. Second operand 4 states and 32 transitions. [2022-12-06 07:37:41,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 189 flow [2022-12-06 07:37:41,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 178 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:37:41,192 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 105 flow [2022-12-06 07:37:41,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 07:37:41,193 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2022-12-06 07:37:41,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:41,193 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 105 flow [2022-12-06 07:37:41,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:41,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:41,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 105 flow [2022-12-06 07:37:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 105 flow [2022-12-06 07:37:41,196 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 07:37:41,197 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-12-06 07:37:41,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 31 events. 9/31 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 48. Up to 12 conditions per place. [2022-12-06 07:37:41,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 105 flow [2022-12-06 07:37:41,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 07:37:41,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] $Ultimate##0-->L60-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [696] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_195| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~counter~0_194 4))))) (and (not (= (ite (and (<= 0 v_~counter~0_194) (< v_~counter~0_194 v_~n~0_96)) 1 0) 0)) (= (ite (= v_~counter~0_194 (select (select |v_#memory_int_195| v_~f_inv~0.base_110) (+ v_~f_inv~0.offset_110 (* .cse0 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (< 0 v_~N~0_51) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= (ite |v_thread1_#t~short4#1_95| 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_31| 1) |v_thread1_#t~short4#1_96| (= v_~counter~0_193 .cse0) (< .cse0 v_~n_inv~0_90))) InVars {~counter~0=v_~counter~0_194, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_195|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~n~0=v_~n~0_96, ~f~0.offset=v_~f~0.offset_104, ~n_inv~0=v_~n_inv~0_90} OutVars{~counter~0=v_~counter~0_193, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_19|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_19|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_19|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~f~0.offset=v_~f~0.offset_104, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_19|, #memory_int=|v_#memory_int_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_23|, ~n~0=v_~n~0_96, ~n_inv~0=v_~n_inv~0_90} AuxVars[|v_thread1_#t~short4#1_95|, |v_thread1_#t~short4#1_96|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:37:41,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:41,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:37:41,287 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 101 flow [2022-12-06 07:37:41,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:41,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:41,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:37:41,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1978054019, now seen corresponding path program 1 times [2022-12-06 07:37:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:41,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388660202] [2022-12-06 07:37:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388660202] [2022-12-06 07:37:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388660202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:41,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785697256] [2022-12-06 07:37:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:41,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:41,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:37:41,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:41,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:37:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:41,386 INFO L130 PetriNetUnfolder]: 52/99 cut-off events. [2022-12-06 07:37:41,386 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 07:37:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 99 events. 52/99 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 193 event pairs, 22 based on Foata normal form. 8/104 useless extension candidates. Maximal degree in co-relation 251. Up to 94 conditions per place. [2022-12-06 07:37:41,387 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 22 selfloop transitions, 2 changer transitions 5/29 dead transitions. [2022-12-06 07:37:41,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 173 flow [2022-12-06 07:37:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 07:37:41,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2022-12-06 07:37:41,387 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 101 flow. Second operand 4 states and 31 transitions. [2022-12-06 07:37:41,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 173 flow [2022-12-06 07:37:41,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 159 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:41,388 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 105 flow [2022-12-06 07:37:41,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 07:37:41,389 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 07:37:41,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:41,389 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 105 flow [2022-12-06 07:37:41,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:41,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:41,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 105 flow [2022-12-06 07:37:41,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 105 flow [2022-12-06 07:37:41,393 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 07:37:41,393 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 07:37:41,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 31 events. 9/31 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 58. Up to 12 conditions per place. [2022-12-06 07:37:41,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 105 flow [2022-12-06 07:37:41,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 07:37:41,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:41,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 07:37:41,620 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 101 flow [2022-12-06 07:37:41,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:41,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:41,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:37:41,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2000341769, now seen corresponding path program 1 times [2022-12-06 07:37:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:41,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596487233] [2022-12-06 07:37:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596487233] [2022-12-06 07:37:41,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596487233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:41,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:41,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955681277] [2022-12-06 07:37:41,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:41,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:37:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:37:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:37:41,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:37:41,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 101 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:41,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:37:41,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:41,884 INFO L130 PetriNetUnfolder]: 171/309 cut-off events. [2022-12-06 07:37:41,884 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-12-06 07:37:41,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 309 events. 171/309 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1113 event pairs, 18 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 540. Up to 133 conditions per place. [2022-12-06 07:37:41,886 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 53 selfloop transitions, 20 changer transitions 5/78 dead transitions. [2022-12-06 07:37:41,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 78 transitions, 459 flow [2022-12-06 07:37:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 07:37:41,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:37:41,887 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 101 flow. Second operand 7 states and 77 transitions. [2022-12-06 07:37:41,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 78 transitions, 459 flow [2022-12-06 07:37:41,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 78 transitions, 425 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:41,888 INFO L231 Difference]: Finished difference. Result has 34 places, 42 transitions, 270 flow [2022-12-06 07:37:41,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=34, PETRI_TRANSITIONS=42} [2022-12-06 07:37:41,889 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 12 predicate places. [2022-12-06 07:37:41,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:41,889 INFO L89 Accepts]: Start accepts. Operand has 34 places, 42 transitions, 270 flow [2022-12-06 07:37:41,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:41,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:41,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 42 transitions, 270 flow [2022-12-06 07:37:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 42 transitions, 270 flow [2022-12-06 07:37:41,896 INFO L130 PetriNetUnfolder]: 25/94 cut-off events. [2022-12-06 07:37:41,896 INFO L131 PetriNetUnfolder]: For 49/51 co-relation queries the response was YES. [2022-12-06 07:37:41,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 94 events. 25/94 cut-off events. For 49/51 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 322 event pairs, 0 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 143. Up to 36 conditions per place. [2022-12-06 07:37:41,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 42 transitions, 270 flow [2022-12-06 07:37:41,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 07:37:44,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:44,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2509 [2022-12-06 07:37:44,398 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-06 07:37:44,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:44,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:44,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:44,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:37:44,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1863967645, now seen corresponding path program 1 times [2022-12-06 07:37:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:44,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466292980] [2022-12-06 07:37:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466292980] [2022-12-06 07:37:44,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466292980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:44,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:44,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845759856] [2022-12-06 07:37:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:44,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:37:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:37:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:37:44,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:37:44,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:44,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:44,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:37:44,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:44,703 INFO L130 PetriNetUnfolder]: 431/777 cut-off events. [2022-12-06 07:37:44,703 INFO L131 PetriNetUnfolder]: For 1071/1071 co-relation queries the response was YES. [2022-12-06 07:37:44,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 777 events. 431/777 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3602 event pairs, 82 based on Foata normal form. 5/777 useless extension candidates. Maximal degree in co-relation 1644. Up to 327 conditions per place. [2022-12-06 07:37:44,706 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 67 selfloop transitions, 31 changer transitions 14/112 dead transitions. [2022-12-06 07:37:44,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 112 transitions, 891 flow [2022-12-06 07:37:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 07:37:44,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2022-12-06 07:37:44,708 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 7 states and 73 transitions. [2022-12-06 07:37:44,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 112 transitions, 891 flow [2022-12-06 07:37:44,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 112 transitions, 843 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-06 07:37:44,711 INFO L231 Difference]: Finished difference. Result has 45 places, 67 transitions, 595 flow [2022-12-06 07:37:44,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=45, PETRI_TRANSITIONS=67} [2022-12-06 07:37:44,712 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 23 predicate places. [2022-12-06 07:37:44,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:44,713 INFO L89 Accepts]: Start accepts. Operand has 45 places, 67 transitions, 595 flow [2022-12-06 07:37:44,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:44,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:44,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 67 transitions, 595 flow [2022-12-06 07:37:44,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 67 transitions, 595 flow [2022-12-06 07:37:44,728 INFO L130 PetriNetUnfolder]: 46/187 cut-off events. [2022-12-06 07:37:44,728 INFO L131 PetriNetUnfolder]: For 205/211 co-relation queries the response was YES. [2022-12-06 07:37:44,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 187 events. 46/187 cut-off events. For 205/211 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 954 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 404. Up to 50 conditions per place. [2022-12-06 07:37:44,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 67 transitions, 595 flow [2022-12-06 07:37:44,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 07:37:44,730 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:44,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:37:44,730 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 67 transitions, 595 flow [2022-12-06 07:37:44,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:44,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:44,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:44,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:37:44,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1865965636, now seen corresponding path program 1 times [2022-12-06 07:37:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626551756] [2022-12-06 07:37:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:45,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626551756] [2022-12-06 07:37:45,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626551756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:45,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:45,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:37:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693141684] [2022-12-06 07:37:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:45,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:37:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:45,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:37:45,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:37:45,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:37:45,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 67 transitions, 595 flow. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:45,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:45,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:37:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:45,531 INFO L130 PetriNetUnfolder]: 446/811 cut-off events. [2022-12-06 07:37:45,532 INFO L131 PetriNetUnfolder]: For 2017/2017 co-relation queries the response was YES. [2022-12-06 07:37:45,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 811 events. 446/811 cut-off events. For 2017/2017 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3840 event pairs, 111 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 2356. Up to 661 conditions per place. [2022-12-06 07:37:45,536 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 76 selfloop transitions, 29 changer transitions 10/115 dead transitions. [2022-12-06 07:37:45,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 115 transitions, 1090 flow [2022-12-06 07:37:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:37:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:37:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-12-06 07:37:45,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33816425120772947 [2022-12-06 07:37:45,537 INFO L175 Difference]: Start difference. First operand has 44 places, 67 transitions, 595 flow. Second operand 9 states and 70 transitions. [2022-12-06 07:37:45,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 115 transitions, 1090 flow [2022-12-06 07:37:45,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 115 transitions, 1062 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:45,545 INFO L231 Difference]: Finished difference. Result has 58 places, 85 transitions, 855 flow [2022-12-06 07:37:45,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=855, PETRI_PLACES=58, PETRI_TRANSITIONS=85} [2022-12-06 07:37:45,545 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 36 predicate places. [2022-12-06 07:37:45,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:45,545 INFO L89 Accepts]: Start accepts. Operand has 58 places, 85 transitions, 855 flow [2022-12-06 07:37:45,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:45,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:45,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 85 transitions, 855 flow [2022-12-06 07:37:45,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 85 transitions, 855 flow [2022-12-06 07:37:45,571 INFO L130 PetriNetUnfolder]: 58/229 cut-off events. [2022-12-06 07:37:45,571 INFO L131 PetriNetUnfolder]: For 454/461 co-relation queries the response was YES. [2022-12-06 07:37:45,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 229 events. 58/229 cut-off events. For 454/461 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1282 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 632. Up to 57 conditions per place. [2022-12-06 07:37:45,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 85 transitions, 855 flow [2022-12-06 07:37:45,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 07:37:48,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_195| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~counter~0_194 4))))) (and (not (= (ite (and (<= 0 v_~counter~0_194) (< v_~counter~0_194 v_~n~0_96)) 1 0) 0)) (= (ite (= v_~counter~0_194 (select (select |v_#memory_int_195| v_~f_inv~0.base_110) (+ v_~f_inv~0.offset_110 (* .cse0 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (< 0 v_~N~0_51) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= (ite |v_thread1_#t~short4#1_95| 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_31| 1) |v_thread1_#t~short4#1_96| (= v_~counter~0_193 .cse0) (< .cse0 v_~n_inv~0_90))) InVars {~counter~0=v_~counter~0_194, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_195|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~n~0=v_~n~0_96, ~f~0.offset=v_~f~0.offset_104, ~n_inv~0=v_~n_inv~0_90} OutVars{~counter~0=v_~counter~0_193, ~f_inv~0.offset=v_~f_inv~0.offset_110, ~f~0.base=v_~f~0.base_104, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_19|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_19|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_19|, ~N~0=v_~N~0_51, ~f_inv~0.base=v_~f_inv~0.base_110, ~f~0.offset=v_~f~0.offset_104, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_19|, #memory_int=|v_#memory_int_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_23|, ~n~0=v_~n~0_96, ~n_inv~0=v_~n_inv~0_90} AuxVars[|v_thread1_#t~short4#1_95|, |v_thread1_#t~short4#1_96|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] and [672] L82-4-->L83-3: Formula: (and (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= |v_#memory_int_181| (store |v_#memory_int_182| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_182| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre22#1_31|))) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre22#1_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_182|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_31|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_181|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_31|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 07:37:48,308 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:37:48,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2764 [2022-12-06 07:37:48,309 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 85 transitions, 883 flow [2022-12-06 07:37:48,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:48,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:48,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:48,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:37:48,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash 948701380, now seen corresponding path program 1 times [2022-12-06 07:37:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:48,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308787795] [2022-12-06 07:37:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:37:48,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:48,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308787795] [2022-12-06 07:37:48,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308787795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:48,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:48,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925526053] [2022-12-06 07:37:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:48,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:48,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:48,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:48,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:37:48,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 85 transitions, 883 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:48,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:48,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:37:48,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:48,622 INFO L130 PetriNetUnfolder]: 783/1447 cut-off events. [2022-12-06 07:37:48,622 INFO L131 PetriNetUnfolder]: For 4441/4441 co-relation queries the response was YES. [2022-12-06 07:37:48,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5806 conditions, 1447 events. 783/1447 cut-off events. For 4441/4441 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8150 event pairs, 204 based on Foata normal form. 12/1457 useless extension candidates. Maximal degree in co-relation 4586. Up to 780 conditions per place. [2022-12-06 07:37:48,629 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 101 selfloop transitions, 62 changer transitions 10/173 dead transitions. [2022-12-06 07:37:48,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 173 transitions, 1967 flow [2022-12-06 07:37:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:37:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:37:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-06 07:37:48,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-06 07:37:48,630 INFO L175 Difference]: Start difference. First operand has 58 places, 85 transitions, 883 flow. Second operand 6 states and 58 transitions. [2022-12-06 07:37:48,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 173 transitions, 1967 flow [2022-12-06 07:37:48,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 173 transitions, 1931 flow, removed 18 selfloop flow, removed 0 redundant places. [2022-12-06 07:37:48,640 INFO L231 Difference]: Finished difference. Result has 66 places, 129 transitions, 1531 flow [2022-12-06 07:37:48,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=66, PETRI_TRANSITIONS=129} [2022-12-06 07:37:48,642 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 44 predicate places. [2022-12-06 07:37:48,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:48,642 INFO L89 Accepts]: Start accepts. Operand has 66 places, 129 transitions, 1531 flow [2022-12-06 07:37:48,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:48,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:48,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 129 transitions, 1531 flow [2022-12-06 07:37:48,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 129 transitions, 1531 flow [2022-12-06 07:37:48,701 INFO L130 PetriNetUnfolder]: 135/487 cut-off events. [2022-12-06 07:37:48,701 INFO L131 PetriNetUnfolder]: For 1427/1451 co-relation queries the response was YES. [2022-12-06 07:37:48,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 487 events. 135/487 cut-off events. For 1427/1451 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3473 event pairs, 18 based on Foata normal form. 13/479 useless extension candidates. Maximal degree in co-relation 1738. Up to 160 conditions per place. [2022-12-06 07:37:48,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 129 transitions, 1531 flow [2022-12-06 07:37:48,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 07:37:48,705 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:48,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 07:37:48,706 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 129 transitions, 1531 flow [2022-12-06 07:37:48,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:48,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:48,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:48,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:37:48,706 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1822984619, now seen corresponding path program 1 times [2022-12-06 07:37:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:48,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316358237] [2022-12-06 07:37:48,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:48,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316358237] [2022-12-06 07:37:49,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316358237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998711528] [2022-12-06 07:37:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:49,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:49,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:49,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:37:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:49,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:37:49,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:49,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-06 07:37:49,544 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:37:49,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 36 [2022-12-06 07:37:49,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-12-06 07:37:49,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:37:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:37:49,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:37:49,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998711528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:49,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:37:49,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-06 07:37:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799756975] [2022-12-06 07:37:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:49,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:37:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:37:49,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:37:49,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:49,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 129 transitions, 1531 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:49,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:49,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:49,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:49,939 INFO L130 PetriNetUnfolder]: 985/1841 cut-off events. [2022-12-06 07:37:49,940 INFO L131 PetriNetUnfolder]: For 7372/7372 co-relation queries the response was YES. [2022-12-06 07:37:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8938 conditions, 1841 events. 985/1841 cut-off events. For 7372/7372 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11081 event pairs, 217 based on Foata normal form. 3/1841 useless extension candidates. Maximal degree in co-relation 7821. Up to 1124 conditions per place. [2022-12-06 07:37:49,950 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 112 selfloop transitions, 90 changer transitions 4/206 dead transitions. [2022-12-06 07:37:49,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 206 transitions, 2636 flow [2022-12-06 07:37:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 07:37:49,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37714285714285717 [2022-12-06 07:37:49,952 INFO L175 Difference]: Start difference. First operand has 65 places, 129 transitions, 1531 flow. Second operand 7 states and 66 transitions. [2022-12-06 07:37:49,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 206 transitions, 2636 flow [2022-12-06 07:37:49,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 206 transitions, 2486 flow, removed 75 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:49,986 INFO L231 Difference]: Finished difference. Result has 73 places, 171 transitions, 2274 flow [2022-12-06 07:37:49,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2274, PETRI_PLACES=73, PETRI_TRANSITIONS=171} [2022-12-06 07:37:49,986 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 51 predicate places. [2022-12-06 07:37:49,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:49,987 INFO L89 Accepts]: Start accepts. Operand has 73 places, 171 transitions, 2274 flow [2022-12-06 07:37:49,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:49,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:49,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 171 transitions, 2274 flow [2022-12-06 07:37:49,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 171 transitions, 2274 flow [2022-12-06 07:37:50,040 INFO L130 PetriNetUnfolder]: 177/631 cut-off events. [2022-12-06 07:37:50,041 INFO L131 PetriNetUnfolder]: For 2314/2341 co-relation queries the response was YES. [2022-12-06 07:37:50,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 631 events. 177/631 cut-off events. For 2314/2341 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4813 event pairs, 27 based on Foata normal form. 12/614 useless extension candidates. Maximal degree in co-relation 2174. Up to 216 conditions per place. [2022-12-06 07:37:50,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 171 transitions, 2274 flow [2022-12-06 07:37:50,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 07:37:50,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:50,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:37:50,071 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 171 transitions, 2274 flow [2022-12-06 07:37:50,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:50,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:50,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:50,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:37:50,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:37:50,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2143642745, now seen corresponding path program 1 times [2022-12-06 07:37:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:50,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603698833] [2022-12-06 07:37:50,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:50,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603698833] [2022-12-06 07:37:50,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603698833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:50,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:50,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:37:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223650445] [2022-12-06 07:37:50,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:50,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:37:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:37:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:37:50,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:50,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 171 transitions, 2274 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:50,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:50,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:50,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:50,981 INFO L130 PetriNetUnfolder]: 1057/1982 cut-off events. [2022-12-06 07:37:50,981 INFO L131 PetriNetUnfolder]: For 10492/10492 co-relation queries the response was YES. [2022-12-06 07:37:50,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10269 conditions, 1982 events. 1057/1982 cut-off events. For 10492/10492 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12210 event pairs, 299 based on Foata normal form. 3/1982 useless extension candidates. Maximal degree in co-relation 8249. Up to 1481 conditions per place. [2022-12-06 07:37:50,995 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 135 selfloop transitions, 35 changer transitions 40/210 dead transitions. [2022-12-06 07:37:50,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 210 transitions, 3025 flow [2022-12-06 07:37:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 07:37:50,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 07:37:50,996 INFO L175 Difference]: Start difference. First operand has 73 places, 171 transitions, 2274 flow. Second operand 7 states and 55 transitions. [2022-12-06 07:37:50,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 210 transitions, 3025 flow [2022-12-06 07:37:51,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 210 transitions, 2993 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:51,021 INFO L231 Difference]: Finished difference. Result has 81 places, 159 transitions, 2153 flow [2022-12-06 07:37:51,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2153, PETRI_PLACES=81, PETRI_TRANSITIONS=159} [2022-12-06 07:37:51,021 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 59 predicate places. [2022-12-06 07:37:51,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:51,022 INFO L89 Accepts]: Start accepts. Operand has 81 places, 159 transitions, 2153 flow [2022-12-06 07:37:51,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:51,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:51,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 159 transitions, 2153 flow [2022-12-06 07:37:51,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 159 transitions, 2153 flow [2022-12-06 07:37:51,070 INFO L130 PetriNetUnfolder]: 149/553 cut-off events. [2022-12-06 07:37:51,070 INFO L131 PetriNetUnfolder]: For 2476/2500 co-relation queries the response was YES. [2022-12-06 07:37:51,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2411 conditions, 553 events. 149/553 cut-off events. For 2476/2500 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4128 event pairs, 22 based on Foata normal form. 11/541 useless extension candidates. Maximal degree in co-relation 2148. Up to 174 conditions per place. [2022-12-06 07:37:51,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 159 transitions, 2153 flow [2022-12-06 07:37:51,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 07:37:51,079 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:51,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 07:37:51,080 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 159 transitions, 2153 flow [2022-12-06 07:37:51,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:51,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:51,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:37:51,081 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 533509889, now seen corresponding path program 1 times [2022-12-06 07:37:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:51,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389155211] [2022-12-06 07:37:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:51,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389155211] [2022-12-06 07:37:51,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389155211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:51,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:51,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707828164] [2022-12-06 07:37:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:51,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:51,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:51,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 159 transitions, 2153 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:51,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:51,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:51,454 INFO L130 PetriNetUnfolder]: 875/1682 cut-off events. [2022-12-06 07:37:51,454 INFO L131 PetriNetUnfolder]: For 9062/9062 co-relation queries the response was YES. [2022-12-06 07:37:51,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8761 conditions, 1682 events. 875/1682 cut-off events. For 9062/9062 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10160 event pairs, 291 based on Foata normal form. 12/1691 useless extension candidates. Maximal degree in co-relation 7869. Up to 880 conditions per place. [2022-12-06 07:37:51,464 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 131 selfloop transitions, 69 changer transitions 1/201 dead transitions. [2022-12-06 07:37:51,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 201 transitions, 2984 flow [2022-12-06 07:37:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:37:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:37:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 07:37:51,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 07:37:51,465 INFO L175 Difference]: Start difference. First operand has 81 places, 159 transitions, 2153 flow. Second operand 5 states and 55 transitions. [2022-12-06 07:37:51,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 201 transitions, 2984 flow [2022-12-06 07:37:51,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 201 transitions, 2883 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-06 07:37:51,486 INFO L231 Difference]: Finished difference. Result has 85 places, 165 transitions, 2333 flow [2022-12-06 07:37:51,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2333, PETRI_PLACES=85, PETRI_TRANSITIONS=165} [2022-12-06 07:37:51,486 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 63 predicate places. [2022-12-06 07:37:51,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:51,486 INFO L89 Accepts]: Start accepts. Operand has 85 places, 165 transitions, 2333 flow [2022-12-06 07:37:51,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:51,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:51,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 165 transitions, 2333 flow [2022-12-06 07:37:51,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 165 transitions, 2333 flow [2022-12-06 07:37:51,534 INFO L130 PetriNetUnfolder]: 152/573 cut-off events. [2022-12-06 07:37:51,534 INFO L131 PetriNetUnfolder]: For 2566/2594 co-relation queries the response was YES. [2022-12-06 07:37:51,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 573 events. 152/573 cut-off events. For 2566/2594 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4322 event pairs, 22 based on Foata normal form. 10/559 useless extension candidates. Maximal degree in co-relation 2395. Up to 187 conditions per place. [2022-12-06 07:37:51,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 165 transitions, 2333 flow [2022-12-06 07:37:51,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-06 07:37:51,540 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:51,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 07:37:51,540 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 165 transitions, 2333 flow [2022-12-06 07:37:51,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:51,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:51,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:37:51,541 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1085654711, now seen corresponding path program 1 times [2022-12-06 07:37:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591098302] [2022-12-06 07:37:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591098302] [2022-12-06 07:37:51,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591098302] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:51,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757863763] [2022-12-06 07:37:51,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:51,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:51,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:51,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:51,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:37:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:51,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:37:51,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:51,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:37:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:51,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757863763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:37:51,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:37:51,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 07:37:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610878032] [2022-12-06 07:37:51,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:37:51,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:37:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:37:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:37:51,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:51,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 165 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:51,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:51,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:52,044 INFO L130 PetriNetUnfolder]: 897/1718 cut-off events. [2022-12-06 07:37:52,044 INFO L131 PetriNetUnfolder]: For 10198/10198 co-relation queries the response was YES. [2022-12-06 07:37:52,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9324 conditions, 1718 events. 897/1718 cut-off events. For 10198/10198 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10477 event pairs, 188 based on Foata normal form. 36/1751 useless extension candidates. Maximal degree in co-relation 8598. Up to 747 conditions per place. [2022-12-06 07:37:52,055 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 148 selfloop transitions, 70 changer transitions 0/218 dead transitions. [2022-12-06 07:37:52,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 218 transitions, 3308 flow [2022-12-06 07:37:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-06 07:37:52,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3485714285714286 [2022-12-06 07:37:52,056 INFO L175 Difference]: Start difference. First operand has 85 places, 165 transitions, 2333 flow. Second operand 7 states and 61 transitions. [2022-12-06 07:37:52,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 218 transitions, 3308 flow [2022-12-06 07:37:52,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 218 transitions, 3226 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:52,081 INFO L231 Difference]: Finished difference. Result has 91 places, 170 transitions, 2506 flow [2022-12-06 07:37:52,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=91, PETRI_TRANSITIONS=170} [2022-12-06 07:37:52,081 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 69 predicate places. [2022-12-06 07:37:52,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:52,082 INFO L89 Accepts]: Start accepts. Operand has 91 places, 170 transitions, 2506 flow [2022-12-06 07:37:52,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:52,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:52,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 170 transitions, 2506 flow [2022-12-06 07:37:52,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 170 transitions, 2506 flow [2022-12-06 07:37:52,132 INFO L130 PetriNetUnfolder]: 159/588 cut-off events. [2022-12-06 07:37:52,132 INFO L131 PetriNetUnfolder]: For 2790/2821 co-relation queries the response was YES. [2022-12-06 07:37:52,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 588 events. 159/588 cut-off events. For 2790/2821 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4465 event pairs, 22 based on Foata normal form. 9/572 useless extension candidates. Maximal degree in co-relation 2664. Up to 194 conditions per place. [2022-12-06 07:37:52,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 170 transitions, 2506 flow [2022-12-06 07:37:52,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 07:37:52,138 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:52,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 07:37:52,138 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 170 transitions, 2506 flow [2022-12-06 07:37:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:52,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:52,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:52,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:52,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:37:52,343 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1639567539, now seen corresponding path program 2 times [2022-12-06 07:37:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:52,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832701476] [2022-12-06 07:37:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:52,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832701476] [2022-12-06 07:37:52,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832701476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:52,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:52,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702940981] [2022-12-06 07:37:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:52,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:52,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:52,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 170 transitions, 2506 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:52,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:52,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:52,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:52,671 INFO L130 PetriNetUnfolder]: 909/1746 cut-off events. [2022-12-06 07:37:52,671 INFO L131 PetriNetUnfolder]: For 12349/12349 co-relation queries the response was YES. [2022-12-06 07:37:52,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9839 conditions, 1746 events. 909/1746 cut-off events. For 12349/12349 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10805 event pairs, 148 based on Foata normal form. 16/1759 useless extension candidates. Maximal degree in co-relation 9357. Up to 628 conditions per place. [2022-12-06 07:37:52,684 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 158 selfloop transitions, 72 changer transitions 16/246 dead transitions. [2022-12-06 07:37:52,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 246 transitions, 3878 flow [2022-12-06 07:37:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 07:37:52,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32571428571428573 [2022-12-06 07:37:52,685 INFO L175 Difference]: Start difference. First operand has 91 places, 170 transitions, 2506 flow. Second operand 7 states and 57 transitions. [2022-12-06 07:37:52,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 246 transitions, 3878 flow [2022-12-06 07:37:52,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 246 transitions, 3704 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:52,716 INFO L231 Difference]: Finished difference. Result has 95 places, 185 transitions, 2676 flow [2022-12-06 07:37:52,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2676, PETRI_PLACES=95, PETRI_TRANSITIONS=185} [2022-12-06 07:37:52,716 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 73 predicate places. [2022-12-06 07:37:52,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:52,717 INFO L89 Accepts]: Start accepts. Operand has 95 places, 185 transitions, 2676 flow [2022-12-06 07:37:52,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:52,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:52,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 185 transitions, 2676 flow [2022-12-06 07:37:52,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 185 transitions, 2676 flow [2022-12-06 07:37:52,790 INFO L130 PetriNetUnfolder]: 180/671 cut-off events. [2022-12-06 07:37:52,790 INFO L131 PetriNetUnfolder]: For 3383/3388 co-relation queries the response was YES. [2022-12-06 07:37:52,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 671 events. 180/671 cut-off events. For 3383/3388 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5312 event pairs, 22 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 3093. Up to 214 conditions per place. [2022-12-06 07:37:52,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 185 transitions, 2676 flow [2022-12-06 07:37:52,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-06 07:37:52,796 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:52,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:37:52,796 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 185 transitions, 2676 flow [2022-12-06 07:37:52,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:52,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:52,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:52,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:37:52,797 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 727892097, now seen corresponding path program 3 times [2022-12-06 07:37:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:52,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665560318] [2022-12-06 07:37:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:52,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:52,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665560318] [2022-12-06 07:37:52,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665560318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:52,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:52,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893871491] [2022-12-06 07:37:52,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:52,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:52,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:52,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:52,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 185 transitions, 2676 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:52,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:52,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:52,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:53,107 INFO L130 PetriNetUnfolder]: 850/1685 cut-off events. [2022-12-06 07:37:53,107 INFO L131 PetriNetUnfolder]: For 11978/11978 co-relation queries the response was YES. [2022-12-06 07:37:53,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9756 conditions, 1685 events. 850/1685 cut-off events. For 11978/11978 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10652 event pairs, 164 based on Foata normal form. 16/1698 useless extension candidates. Maximal degree in co-relation 9278. Up to 628 conditions per place. [2022-12-06 07:37:53,120 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 155 selfloop transitions, 83 changer transitions 3/241 dead transitions. [2022-12-06 07:37:53,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 241 transitions, 3716 flow [2022-12-06 07:37:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 07:37:53,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2022-12-06 07:37:53,121 INFO L175 Difference]: Start difference. First operand has 95 places, 185 transitions, 2676 flow. Second operand 7 states and 64 transitions. [2022-12-06 07:37:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 241 transitions, 3716 flow [2022-12-06 07:37:53,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 241 transitions, 3680 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:53,159 INFO L231 Difference]: Finished difference. Result has 102 places, 189 transitions, 2915 flow [2022-12-06 07:37:53,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2593, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2915, PETRI_PLACES=102, PETRI_TRANSITIONS=189} [2022-12-06 07:37:53,160 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 80 predicate places. [2022-12-06 07:37:53,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:53,160 INFO L89 Accepts]: Start accepts. Operand has 102 places, 189 transitions, 2915 flow [2022-12-06 07:37:53,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:53,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:53,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 189 transitions, 2915 flow [2022-12-06 07:37:53,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 189 transitions, 2915 flow [2022-12-06 07:37:53,235 INFO L130 PetriNetUnfolder]: 176/649 cut-off events. [2022-12-06 07:37:53,235 INFO L131 PetriNetUnfolder]: For 3929/3934 co-relation queries the response was YES. [2022-12-06 07:37:53,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3468 conditions, 649 events. 176/649 cut-off events. For 3929/3934 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5047 event pairs, 22 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 3311. Up to 200 conditions per place. [2022-12-06 07:37:53,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 189 transitions, 2915 flow [2022-12-06 07:37:53,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-06 07:37:53,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:53,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:37:53,243 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 189 transitions, 2915 flow [2022-12-06 07:37:53,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:53,244 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:53,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:37:53,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1779443366, now seen corresponding path program 1 times [2022-12-06 07:37:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:53,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787425639] [2022-12-06 07:37:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:53,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787425639] [2022-12-06 07:37:53,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787425639] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:53,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598614606] [2022-12-06 07:37:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:53,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:53,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:53,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:53,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:37:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:53,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:37:53,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:53,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:37:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598614606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:37:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 07:37:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896301459] [2022-12-06 07:37:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:53,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:37:53,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:53,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 189 transitions, 2915 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:53,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:53,744 INFO L130 PetriNetUnfolder]: 878/1745 cut-off events. [2022-12-06 07:37:53,744 INFO L131 PetriNetUnfolder]: For 13044/13044 co-relation queries the response was YES. [2022-12-06 07:37:53,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 1745 events. 878/1745 cut-off events. For 13044/13044 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11073 event pairs, 393 based on Foata normal form. 12/1754 useless extension candidates. Maximal degree in co-relation 10324. Up to 1529 conditions per place. [2022-12-06 07:37:53,756 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 184 selfloop transitions, 30 changer transitions 3/217 dead transitions. [2022-12-06 07:37:53,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 217 transitions, 3644 flow [2022-12-06 07:37:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:37:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:37:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:37:53,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.384 [2022-12-06 07:37:53,757 INFO L175 Difference]: Start difference. First operand has 102 places, 189 transitions, 2915 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:37:53,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 217 transitions, 3644 flow [2022-12-06 07:37:53,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 217 transitions, 3568 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:37:53,794 INFO L231 Difference]: Finished difference. Result has 106 places, 196 transitions, 3065 flow [2022-12-06 07:37:53,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3065, PETRI_PLACES=106, PETRI_TRANSITIONS=196} [2022-12-06 07:37:53,795 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 84 predicate places. [2022-12-06 07:37:53,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:53,795 INFO L89 Accepts]: Start accepts. Operand has 106 places, 196 transitions, 3065 flow [2022-12-06 07:37:53,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:53,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:53,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 196 transitions, 3065 flow [2022-12-06 07:37:53,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 196 transitions, 3065 flow [2022-12-06 07:37:53,855 INFO L130 PetriNetUnfolder]: 181/676 cut-off events. [2022-12-06 07:37:53,855 INFO L131 PetriNetUnfolder]: For 4098/4104 co-relation queries the response was YES. [2022-12-06 07:37:53,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 676 events. 181/676 cut-off events. For 4098/4104 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5333 event pairs, 22 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 3470. Up to 210 conditions per place. [2022-12-06 07:37:53,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 196 transitions, 3065 flow [2022-12-06 07:37:53,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 07:37:53,862 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:53,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 07:37:53,863 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 196 transitions, 3065 flow [2022-12-06 07:37:53,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:53,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:53,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:37:54,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:54,070 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 23906634, now seen corresponding path program 1 times [2022-12-06 07:37:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:54,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657396632] [2022-12-06 07:37:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:54,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657396632] [2022-12-06 07:37:54,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657396632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:54,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:54,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219116561] [2022-12-06 07:37:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:54,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:54,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:54,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:54,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:54,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 196 transitions, 3065 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:54,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:54,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:54,418 INFO L130 PetriNetUnfolder]: 1020/2013 cut-off events. [2022-12-06 07:37:54,418 INFO L131 PetriNetUnfolder]: For 16077/16077 co-relation queries the response was YES. [2022-12-06 07:37:54,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12448 conditions, 2013 events. 1020/2013 cut-off events. For 16077/16077 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13083 event pairs, 366 based on Foata normal form. 20/2030 useless extension candidates. Maximal degree in co-relation 11956. Up to 1434 conditions per place. [2022-12-06 07:37:54,432 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 184 selfloop transitions, 64 changer transitions 3/251 dead transitions. [2022-12-06 07:37:54,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 251 transitions, 4237 flow [2022-12-06 07:37:54,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:37:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:37:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 07:37:54,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.416 [2022-12-06 07:37:54,433 INFO L175 Difference]: Start difference. First operand has 106 places, 196 transitions, 3065 flow. Second operand 5 states and 52 transitions. [2022-12-06 07:37:54,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 251 transitions, 4237 flow [2022-12-06 07:37:54,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 251 transitions, 4172 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 07:37:54,476 INFO L231 Difference]: Finished difference. Result has 111 places, 216 transitions, 3597 flow [2022-12-06 07:37:54,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3597, PETRI_PLACES=111, PETRI_TRANSITIONS=216} [2022-12-06 07:37:54,477 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 89 predicate places. [2022-12-06 07:37:54,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:54,477 INFO L89 Accepts]: Start accepts. Operand has 111 places, 216 transitions, 3597 flow [2022-12-06 07:37:54,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:54,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:54,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 216 transitions, 3597 flow [2022-12-06 07:37:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 216 transitions, 3597 flow [2022-12-06 07:37:54,550 INFO L130 PetriNetUnfolder]: 203/763 cut-off events. [2022-12-06 07:37:54,551 INFO L131 PetriNetUnfolder]: For 5276/5286 co-relation queries the response was YES. [2022-12-06 07:37:54,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 763 events. 203/763 cut-off events. For 5276/5286 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6247 event pairs, 29 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 4091. Up to 253 conditions per place. [2022-12-06 07:37:54,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 216 transitions, 3597 flow [2022-12-06 07:37:54,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 716 [2022-12-06 07:37:54,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:54,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:37:54,559 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 216 transitions, 3597 flow [2022-12-06 07:37:54,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:54,560 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:54,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:37:54,560 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1456018078, now seen corresponding path program 2 times [2022-12-06 07:37:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:54,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487804689] [2022-12-06 07:37:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:54,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487804689] [2022-12-06 07:37:54,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487804689] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:54,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700664576] [2022-12-06 07:37:54,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:37:54,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:54,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:54,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:37:54,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:37:54,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:37:54,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:37:54,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:54,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:37:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700664576] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:37:54,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:37:54,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:37:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424669589] [2022-12-06 07:37:54,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:37:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:37:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:37:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:37:54,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:37:54,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 216 transitions, 3597 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:54,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:37:54,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:55,247 INFO L130 PetriNetUnfolder]: 1244/2506 cut-off events. [2022-12-06 07:37:55,247 INFO L131 PetriNetUnfolder]: For 21500/21500 co-relation queries the response was YES. [2022-12-06 07:37:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15547 conditions, 2506 events. 1244/2506 cut-off events. For 21500/21500 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17529 event pairs, 236 based on Foata normal form. 32/2535 useless extension candidates. Maximal degree in co-relation 15019. Up to 1085 conditions per place. [2022-12-06 07:37:55,267 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 220 selfloop transitions, 93 changer transitions 9/322 dead transitions. [2022-12-06 07:37:55,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 322 transitions, 5338 flow [2022-12-06 07:37:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:37:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:37:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-12-06 07:37:55,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-06 07:37:55,268 INFO L175 Difference]: Start difference. First operand has 111 places, 216 transitions, 3597 flow. Second operand 11 states and 88 transitions. [2022-12-06 07:37:55,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 322 transitions, 5338 flow [2022-12-06 07:37:55,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 322 transitions, 5296 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-12-06 07:37:55,320 INFO L231 Difference]: Finished difference. Result has 128 places, 260 transitions, 4536 flow [2022-12-06 07:37:55,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3538, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4536, PETRI_PLACES=128, PETRI_TRANSITIONS=260} [2022-12-06 07:37:55,320 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 106 predicate places. [2022-12-06 07:37:55,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:55,320 INFO L89 Accepts]: Start accepts. Operand has 128 places, 260 transitions, 4536 flow [2022-12-06 07:37:55,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:55,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:55,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 260 transitions, 4536 flow [2022-12-06 07:37:55,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 260 transitions, 4536 flow [2022-12-06 07:37:55,422 INFO L130 PetriNetUnfolder]: 265/982 cut-off events. [2022-12-06 07:37:55,422 INFO L131 PetriNetUnfolder]: For 8891/8903 co-relation queries the response was YES. [2022-12-06 07:37:55,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5836 conditions, 982 events. 265/982 cut-off events. For 8891/8903 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8419 event pairs, 35 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 5655. Up to 330 conditions per place. [2022-12-06 07:37:55,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 260 transitions, 4536 flow [2022-12-06 07:37:55,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-06 07:37:55,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:37:55,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:37:55,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:37:55,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] L60-4-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_2| v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_2|, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [660] L47-4-->L47-4: Formula: (let ((.cse0 (select (select |v_#memory_int_171| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~counter~0_176 4))))) (and (= (ite (= v_~counter~0_176 (select (select |v_#memory_int_171| v_~f_inv~0.base_98) (+ v_~f_inv~0.offset_98 (* 4 .cse0)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= v_~counter~0_175 .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_28| 1) |v_thread1Thread1of1ForFork0_~i~0#1_27|) (not (= (ite |v_thread1_#t~short4#1_88| 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (<= 0 .cse0) (not (= (ite (and (<= 0 v_~counter~0_176) (< v_~counter~0_176 v_~n~0_70)) 1 0) 0)) |v_thread1_#t~short4#1_87| (< .cse0 v_~n_inv~0_64) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_28| v_~N~0_33))) InVars {~counter~0=v_~counter~0_176, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_28|, #memory_int=|v_#memory_int_171|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_90, ~n_inv~0=v_~n_inv~0_64} OutVars{~counter~0=v_~counter~0_175, ~f_inv~0.offset=v_~f_inv~0.offset_98, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_17|, thread1Thread1of1ForFork0_#t~short4#1=|v_thread1Thread1of1ForFork0_#t~short4#1_17|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_33, ~f_inv~0.base=v_~f_inv~0.base_98, ~f~0.offset=v_~f~0.offset_90, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_17|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_27|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_17|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_21|, ~n~0=v_~n~0_70, ~n_inv~0=v_~n_inv~0_64} AuxVars[|v_thread1_#t~short4#1_88|, |v_thread1_#t~short4#1_87|] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:37:56,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:56,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 698 [2022-12-06 07:37:56,018 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 260 transitions, 4584 flow [2022-12-06 07:37:56,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:56,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:56,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:56,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:37:56,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:56,223 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 345198502, now seen corresponding path program 2 times [2022-12-06 07:37:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992788534] [2022-12-06 07:37:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:56,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992788534] [2022-12-06 07:37:56,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992788534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:56,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:56,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:37:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196405072] [2022-12-06 07:37:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:56,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:37:56,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:37:56,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 260 transitions, 4584 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:56,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:56,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:37:56,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:56,680 INFO L130 PetriNetUnfolder]: 1193/2413 cut-off events. [2022-12-06 07:37:56,680 INFO L131 PetriNetUnfolder]: For 27383/27383 co-relation queries the response was YES. [2022-12-06 07:37:56,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16468 conditions, 2413 events. 1193/2413 cut-off events. For 27383/27383 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 16689 event pairs, 471 based on Foata normal form. 8/2418 useless extension candidates. Maximal degree in co-relation 15913. Up to 1899 conditions per place. [2022-12-06 07:37:56,702 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 233 selfloop transitions, 59 changer transitions 5/297 dead transitions. [2022-12-06 07:37:56,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 297 transitions, 5569 flow [2022-12-06 07:37:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:37:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:37:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 07:37:56,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3390804597701149 [2022-12-06 07:37:56,703 INFO L175 Difference]: Start difference. First operand has 128 places, 260 transitions, 4584 flow. Second operand 6 states and 59 transitions. [2022-12-06 07:37:56,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 297 transitions, 5569 flow [2022-12-06 07:37:56,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 297 transitions, 5300 flow, removed 87 selfloop flow, removed 2 redundant places. [2022-12-06 07:37:56,797 INFO L231 Difference]: Finished difference. Result has 134 places, 265 transitions, 4592 flow [2022-12-06 07:37:56,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4592, PETRI_PLACES=134, PETRI_TRANSITIONS=265} [2022-12-06 07:37:56,797 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 112 predicate places. [2022-12-06 07:37:56,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:56,797 INFO L89 Accepts]: Start accepts. Operand has 134 places, 265 transitions, 4592 flow [2022-12-06 07:37:56,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:56,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:56,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 265 transitions, 4592 flow [2022-12-06 07:37:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 265 transitions, 4592 flow [2022-12-06 07:37:56,909 INFO L130 PetriNetUnfolder]: 260/954 cut-off events. [2022-12-06 07:37:56,910 INFO L131 PetriNetUnfolder]: For 8952/8964 co-relation queries the response was YES. [2022-12-06 07:37:56,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 954 events. 260/954 cut-off events. For 8952/8964 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8123 event pairs, 40 based on Foata normal form. 1/930 useless extension candidates. Maximal degree in co-relation 5562. Up to 327 conditions per place. [2022-12-06 07:37:56,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 265 transitions, 4592 flow [2022-12-06 07:37:56,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-06 07:37:56,919 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:56,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 07:37:56,920 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 265 transitions, 4592 flow [2022-12-06 07:37:56,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:56,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:56,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:56,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:37:56,920 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 736231452, now seen corresponding path program 1 times [2022-12-06 07:37:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:56,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882113492] [2022-12-06 07:37:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882113492] [2022-12-06 07:37:56,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882113492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115146024] [2022-12-06 07:37:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:56,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:56,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:37:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:57,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:37:57,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:57,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:37:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:57,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115146024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:37:57,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:37:57,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:37:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777541265] [2022-12-06 07:37:57,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:37:57,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:37:57,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:57,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:37:57,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:37:57,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:37:57,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 265 transitions, 4592 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:57,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:57,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:37:57,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:57,551 INFO L130 PetriNetUnfolder]: 1227/2477 cut-off events. [2022-12-06 07:37:57,552 INFO L131 PetriNetUnfolder]: For 29897/29897 co-relation queries the response was YES. [2022-12-06 07:37:57,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17180 conditions, 2477 events. 1227/2477 cut-off events. For 29897/29897 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17154 event pairs, 603 based on Foata normal form. 42/2516 useless extension candidates. Maximal degree in co-relation 16519. Up to 2337 conditions per place. [2022-12-06 07:37:57,570 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 266 selfloop transitions, 29 changer transitions 2/297 dead transitions. [2022-12-06 07:37:57,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 297 transitions, 5597 flow [2022-12-06 07:37:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:37:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:37:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 07:37:57,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3045977011494253 [2022-12-06 07:37:57,571 INFO L175 Difference]: Start difference. First operand has 134 places, 265 transitions, 4592 flow. Second operand 6 states and 53 transitions. [2022-12-06 07:37:57,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 297 transitions, 5597 flow [2022-12-06 07:37:57,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 297 transitions, 5362 flow, removed 41 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:57,712 INFO L231 Difference]: Finished difference. Result has 138 places, 274 transitions, 4647 flow [2022-12-06 07:37:57,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4357, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4647, PETRI_PLACES=138, PETRI_TRANSITIONS=274} [2022-12-06 07:37:57,712 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 116 predicate places. [2022-12-06 07:37:57,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:57,712 INFO L89 Accepts]: Start accepts. Operand has 138 places, 274 transitions, 4647 flow [2022-12-06 07:37:57,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:57,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:57,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 274 transitions, 4647 flow [2022-12-06 07:37:57,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 274 transitions, 4647 flow [2022-12-06 07:37:57,811 INFO L130 PetriNetUnfolder]: 270/987 cut-off events. [2022-12-06 07:37:57,811 INFO L131 PetriNetUnfolder]: For 10083/10107 co-relation queries the response was YES. [2022-12-06 07:37:57,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6019 conditions, 987 events. 270/987 cut-off events. For 10083/10107 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8455 event pairs, 41 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 5762. Up to 336 conditions per place. [2022-12-06 07:37:57,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 274 transitions, 4647 flow [2022-12-06 07:37:57,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 07:37:57,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L47-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [598] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_127| v_~f_inv~0.base_78) (+ (* v_~counter~0_160 4) v_~f_inv~0.offset_78)))) (and (not (= (ite |v_thread2_#t~short11#1_91| 1 0) 0)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (< .cse0 v_~n~0_56) (not (= (ite (and (<= 0 v_~counter~0_160) (< v_~counter~0_160 v_~n_inv~0_42)) 1 0) 0)) (= v_~counter~0_159 .cse0) (<= 0 .cse0) (< |v_thread2Thread1of1ForFork1_~i~1#1_24| v_~N~0_19) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (ite (= v_~counter~0_160 (select (select |v_#memory_int_127| v_~f~0.base_74) (+ (* .cse0 4) v_~f~0.offset_74))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) |v_thread2_#t~short11#1_92| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)))) InVars {~counter~0=v_~counter~0_160, ~f_inv~0.offset=v_~f_inv~0.offset_78, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~n~0=v_~n~0_56, ~f~0.offset=v_~f~0.offset_74, ~n_inv~0=v_~n_inv~0_42} OutVars{~counter~0=v_~counter~0_159, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_15|, ~f_inv~0.offset=v_~f_inv~0.offset_78, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_15|, ~f~0.base=v_~f~0.base_74, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~f~0.offset=v_~f~0.offset_74, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_15|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_15|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_19|, ~n~0=v_~n~0_56, ~n_inv~0=v_~n_inv~0_42} AuxVars[|v_thread2_#t~short11#1_91|, |v_thread2_#t~short11#1_92|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:37:57,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L47-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [598] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_127| v_~f_inv~0.base_78) (+ (* v_~counter~0_160 4) v_~f_inv~0.offset_78)))) (and (not (= (ite |v_thread2_#t~short11#1_91| 1 0) 0)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (< .cse0 v_~n~0_56) (not (= (ite (and (<= 0 v_~counter~0_160) (< v_~counter~0_160 v_~n_inv~0_42)) 1 0) 0)) (= v_~counter~0_159 .cse0) (<= 0 .cse0) (< |v_thread2Thread1of1ForFork1_~i~1#1_24| v_~N~0_19) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (ite (= v_~counter~0_160 (select (select |v_#memory_int_127| v_~f~0.base_74) (+ (* .cse0 4) v_~f~0.offset_74))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) |v_thread2_#t~short11#1_92| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)))) InVars {~counter~0=v_~counter~0_160, ~f_inv~0.offset=v_~f_inv~0.offset_78, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~n~0=v_~n~0_56, ~f~0.offset=v_~f~0.offset_74, ~n_inv~0=v_~n_inv~0_42} OutVars{~counter~0=v_~counter~0_159, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_15|, ~f_inv~0.offset=v_~f_inv~0.offset_78, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_15|, ~f~0.base=v_~f~0.base_74, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~f~0.offset=v_~f~0.offset_74, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_15|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_15|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_19|, ~n~0=v_~n~0_56, ~n_inv~0=v_~n_inv~0_42} AuxVars[|v_thread2_#t~short11#1_91|, |v_thread2_#t~short11#1_92|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:37:58,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L47-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [598] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_127| v_~f_inv~0.base_78) (+ (* v_~counter~0_160 4) v_~f_inv~0.offset_78)))) (and (not (= (ite |v_thread2_#t~short11#1_91| 1 0) 0)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (< .cse0 v_~n~0_56) (not (= (ite (and (<= 0 v_~counter~0_160) (< v_~counter~0_160 v_~n_inv~0_42)) 1 0) 0)) (= v_~counter~0_159 .cse0) (<= 0 .cse0) (< |v_thread2Thread1of1ForFork1_~i~1#1_24| v_~N~0_19) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (ite (= v_~counter~0_160 (select (select |v_#memory_int_127| v_~f~0.base_74) (+ (* .cse0 4) v_~f~0.offset_74))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) |v_thread2_#t~short11#1_92| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)))) InVars {~counter~0=v_~counter~0_160, ~f_inv~0.offset=v_~f_inv~0.offset_78, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~n~0=v_~n~0_56, ~f~0.offset=v_~f~0.offset_74, ~n_inv~0=v_~n_inv~0_42} OutVars{~counter~0=v_~counter~0_159, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_15|, ~f_inv~0.offset=v_~f_inv~0.offset_78, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_15|, ~f~0.base=v_~f~0.base_74, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_19, ~f_inv~0.base=v_~f_inv~0.base_78, ~f~0.offset=v_~f~0.offset_74, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_15|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_15|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_17|, #memory_int=|v_#memory_int_127|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_19|, ~n~0=v_~n~0_56, ~n_inv~0=v_~n_inv~0_42} AuxVars[|v_thread2_#t~short11#1_91|, |v_thread2_#t~short11#1_92|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-06 07:37:58,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:58,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 537 [2022-12-06 07:37:58,249 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 273 transitions, 4665 flow [2022-12-06 07:37:58,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:58,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:58,249 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:58,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:58,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 07:37:58,454 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1326498288, now seen corresponding path program 3 times [2022-12-06 07:37:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:58,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745852065] [2022-12-06 07:37:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:58,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745852065] [2022-12-06 07:37:58,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745852065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527858858] [2022-12-06 07:37:58,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:37:58,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:58,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:58,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:58,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:37:58,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:37:58,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:37:58,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:37:58,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:58,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:37:58,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527858858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:58,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:37:58,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 07:37:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834360495] [2022-12-06 07:37:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:58,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:37:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:37:58,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:37:58,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:37:58,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 273 transitions, 4665 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:58,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:58,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:37:58,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:59,119 INFO L130 PetriNetUnfolder]: 1188/2398 cut-off events. [2022-12-06 07:37:59,119 INFO L131 PetriNetUnfolder]: For 29113/29113 co-relation queries the response was YES. [2022-12-06 07:37:59,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16700 conditions, 2398 events. 1188/2398 cut-off events. For 29113/29113 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16487 event pairs, 576 based on Foata normal form. 8/2403 useless extension candidates. Maximal degree in co-relation 16026. Up to 2257 conditions per place. [2022-12-06 07:37:59,149 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 253 selfloop transitions, 18 changer transitions 15/286 dead transitions. [2022-12-06 07:37:59,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 286 transitions, 5351 flow [2022-12-06 07:37:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:37:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:37:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:37:59,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 07:37:59,150 INFO L175 Difference]: Start difference. First operand has 137 places, 273 transitions, 4665 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:37:59,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 286 transitions, 5351 flow [2022-12-06 07:37:59,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 286 transitions, 5200 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:59,250 INFO L231 Difference]: Finished difference. Result has 140 places, 267 transitions, 4469 flow [2022-12-06 07:37:59,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4516, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4469, PETRI_PLACES=140, PETRI_TRANSITIONS=267} [2022-12-06 07:37:59,250 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 118 predicate places. [2022-12-06 07:37:59,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:59,250 INFO L89 Accepts]: Start accepts. Operand has 140 places, 267 transitions, 4469 flow [2022-12-06 07:37:59,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:59,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:59,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 267 transitions, 4469 flow [2022-12-06 07:37:59,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 267 transitions, 4469 flow [2022-12-06 07:37:59,343 INFO L130 PetriNetUnfolder]: 266/927 cut-off events. [2022-12-06 07:37:59,344 INFO L131 PetriNetUnfolder]: For 9165/9189 co-relation queries the response was YES. [2022-12-06 07:37:59,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 927 events. 266/927 cut-off events. For 9165/9189 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7589 event pairs, 38 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 5438. Up to 306 conditions per place. [2022-12-06 07:37:59,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 267 transitions, 4469 flow [2022-12-06 07:37:59,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 800 [2022-12-06 07:37:59,352 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:59,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 07:37:59,353 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 267 transitions, 4469 flow [2022-12-06 07:37:59,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:59,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:59,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:59,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:59,558 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:37:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -169792398, now seen corresponding path program 1 times [2022-12-06 07:37:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:59,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657254488] [2022-12-06 07:37:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:59,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657254488] [2022-12-06 07:37:59,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657254488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:59,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280093936] [2022-12-06 07:37:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:59,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:59,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:59,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:37:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:59,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:37:59,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:59,887 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-06 07:37:59,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 84 [2022-12-06 07:37:59,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-06 07:37:59,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-12-06 07:37:59,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 19 [2022-12-06 07:37:59,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-06 07:37:59,912 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:37:59,912 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2022-12-06 07:37:59,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 07:37:59,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:37:59,963 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:37:59,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-12-06 07:37:59,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-06 07:37:59,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:38:00,068 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 07:38:00,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 19 [2022-12-06 07:38:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:00,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:02,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280093936] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:02,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:02,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-12-06 07:38:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870463395] [2022-12-06 07:38:02,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:02,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:38:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:38:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=177, Unknown=4, NotChecked=0, Total=240 [2022-12-06 07:38:02,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:38:02,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 267 transitions, 4469 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:02,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:02,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:38:02,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:03,775 INFO L130 PetriNetUnfolder]: 1566/3117 cut-off events. [2022-12-06 07:38:03,775 INFO L131 PetriNetUnfolder]: For 37032/37032 co-relation queries the response was YES. [2022-12-06 07:38:03,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21620 conditions, 3117 events. 1566/3117 cut-off events. For 37032/37032 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 22360 event pairs, 370 based on Foata normal form. 8/3122 useless extension candidates. Maximal degree in co-relation 20572. Up to 1291 conditions per place. [2022-12-06 07:38:03,792 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 198 selfloop transitions, 81 changer transitions 186/465 dead transitions. [2022-12-06 07:38:03,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 465 transitions, 7971 flow [2022-12-06 07:38:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:38:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:38:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2022-12-06 07:38:03,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31919642857142855 [2022-12-06 07:38:03,793 INFO L175 Difference]: Start difference. First operand has 138 places, 267 transitions, 4469 flow. Second operand 14 states and 143 transitions. [2022-12-06 07:38:03,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 465 transitions, 7971 flow [2022-12-06 07:38:03,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 465 transitions, 7869 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 07:38:03,914 INFO L231 Difference]: Finished difference. Result has 151 places, 232 transitions, 4012 flow [2022-12-06 07:38:03,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4400, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4012, PETRI_PLACES=151, PETRI_TRANSITIONS=232} [2022-12-06 07:38:03,914 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 129 predicate places. [2022-12-06 07:38:03,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:03,914 INFO L89 Accepts]: Start accepts. Operand has 151 places, 232 transitions, 4012 flow [2022-12-06 07:38:03,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:03,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:03,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 232 transitions, 4012 flow [2022-12-06 07:38:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 232 transitions, 4012 flow [2022-12-06 07:38:03,995 INFO L130 PetriNetUnfolder]: 209/756 cut-off events. [2022-12-06 07:38:03,996 INFO L131 PetriNetUnfolder]: For 7895/7918 co-relation queries the response was YES. [2022-12-06 07:38:03,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 756 events. 209/756 cut-off events. For 7895/7918 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5939 event pairs, 36 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 4583. Up to 253 conditions per place. [2022-12-06 07:38:04,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 232 transitions, 4012 flow [2022-12-06 07:38:04,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 07:38:06,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:06,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2908 [2022-12-06 07:38:06,822 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 232 transitions, 4028 flow [2022-12-06 07:38:06,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:06,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:06,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:06,831 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-06 07:38:07,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:07,027 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:38:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1287169788, now seen corresponding path program 2 times [2022-12-06 07:38:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:07,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956160840] [2022-12-06 07:38:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:07,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956160840] [2022-12-06 07:38:07,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956160840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:38:07,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105334508] [2022-12-06 07:38:07,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:38:07,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:38:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:07,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:38:07,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:38:07,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:38:07,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:38:07,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:38:07,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:38:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:07,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:38:07,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105334508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:38:07,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:38:07,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 07:38:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530222407] [2022-12-06 07:38:07,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:38:07,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:38:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:38:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:38:07,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:38:07,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 232 transitions, 4028 flow. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:07,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:07,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:38:07,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:07,604 INFO L130 PetriNetUnfolder]: 919/1865 cut-off events. [2022-12-06 07:38:07,604 INFO L131 PetriNetUnfolder]: For 23640/23640 co-relation queries the response was YES. [2022-12-06 07:38:07,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 1865 events. 919/1865 cut-off events. For 23640/23640 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12079 event pairs, 185 based on Foata normal form. 36/1898 useless extension candidates. Maximal degree in co-relation 12760. Up to 1179 conditions per place. [2022-12-06 07:38:07,617 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 179 selfloop transitions, 98 changer transitions 1/278 dead transitions. [2022-12-06 07:38:07,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 278 transitions, 5031 flow [2022-12-06 07:38:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:38:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:38:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-12-06 07:38:07,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2867383512544803 [2022-12-06 07:38:07,620 INFO L175 Difference]: Start difference. First operand has 141 places, 232 transitions, 4028 flow. Second operand 9 states and 80 transitions. [2022-12-06 07:38:07,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 278 transitions, 5031 flow [2022-12-06 07:38:07,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 278 transitions, 4744 flow, removed 89 selfloop flow, removed 13 redundant places. [2022-12-06 07:38:07,692 INFO L231 Difference]: Finished difference. Result has 139 places, 233 transitions, 4013 flow [2022-12-06 07:38:07,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4013, PETRI_PLACES=139, PETRI_TRANSITIONS=233} [2022-12-06 07:38:07,693 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 117 predicate places. [2022-12-06 07:38:07,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:07,693 INFO L89 Accepts]: Start accepts. Operand has 139 places, 233 transitions, 4013 flow [2022-12-06 07:38:07,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:07,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:07,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 233 transitions, 4013 flow [2022-12-06 07:38:07,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 233 transitions, 4013 flow [2022-12-06 07:38:07,768 INFO L130 PetriNetUnfolder]: 206/752 cut-off events. [2022-12-06 07:38:07,768 INFO L131 PetriNetUnfolder]: For 7916/7940 co-relation queries the response was YES. [2022-12-06 07:38:07,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 752 events. 206/752 cut-off events. For 7916/7940 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5923 event pairs, 34 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 4369. Up to 250 conditions per place. [2022-12-06 07:38:07,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 233 transitions, 4013 flow [2022-12-06 07:38:07,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE310 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE122 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE97 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE350 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE329 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,783 WARN L322 ript$VariableManager]: TermVariable LBE107 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,784 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:38:07,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:38:07,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 07:38:07,992 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2_#t~short11#1_186 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:38:07,994 INFO L158 Benchmark]: Toolchain (without parser) took 35759.30ms. Allocated memory was 194.0MB in the beginning and 773.8MB in the end (delta: 579.9MB). Free memory was 170.7MB in the beginning and 350.1MB in the end (delta: -179.4MB). Peak memory consumption was 401.5MB. Max. memory is 8.0GB. [2022-12-06 07:38:07,994 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:38:07,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.62ms. Allocated memory is still 194.0MB. Free memory was 170.7MB in the beginning and 157.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:38:07,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.73ms. Allocated memory is still 194.0MB. Free memory was 157.6MB in the beginning and 155.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:38:07,995 INFO L158 Benchmark]: Boogie Preprocessor took 39.85ms. Allocated memory is still 194.0MB. Free memory was 155.5MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:38:07,995 INFO L158 Benchmark]: RCFGBuilder took 601.52ms. Allocated memory is still 194.0MB. Free memory was 154.0MB in the beginning and 120.9MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 07:38:07,995 INFO L158 Benchmark]: TraceAbstraction took 34836.26ms. Allocated memory was 194.0MB in the beginning and 773.8MB in the end (delta: 579.9MB). Free memory was 119.9MB in the beginning and 350.1MB in the end (delta: -230.2MB). Peak memory consumption was 351.2MB. Max. memory is 8.0GB. [2022-12-06 07:38:07,996 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.62ms. Allocated memory is still 194.0MB. Free memory was 170.7MB in the beginning and 157.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.73ms. Allocated memory is still 194.0MB. Free memory was 157.6MB in the beginning and 155.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.85ms. Allocated memory is still 194.0MB. Free memory was 155.5MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 601.52ms. Allocated memory is still 194.0MB. Free memory was 154.0MB in the beginning and 120.9MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34836.26ms. Allocated memory was 194.0MB in the beginning and 773.8MB in the end (delta: 579.9MB). Free memory was 119.9MB in the beginning and 350.1MB in the end (delta: -230.2MB). Peak memory consumption was 351.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 134 PlacesBefore, 22 PlacesAfterwards, 140 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 93 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 257, unknown conditional: 0, unknown unconditional: 257] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 391, Positive conditional cache size: 0, Positive unconditional cache size: 391, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 26 PlacesBefore, 25 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 26 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 3, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 32 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 28 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 34 PlacesBefore, 34 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 3, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 58 PlacesBefore, 58 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 196 TransitionsBefore, 196 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 216 TransitionsBefore, 216 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 128 PlacesBefore, 128 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 134 PlacesBefore, 134 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 7, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 138 PlacesBefore, 137 PlacesAfterwards, 274 TransitionsBefore, 273 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 138 PlacesBefore, 138 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 800 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 141 PlacesBefore, 141 PlacesAfterwards, 232 TransitionsBefore, 232 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 10, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2_#t~short11#1_186 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2_#t~short11#1_186 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:38:08,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...